.png){kind=icon}
.png){kind=icon}
Return
Heterogeneous Adaptive Preference Learning for Recommendation
.png){kind=icon}
PRE
AI
DOI：10.1145/3656480.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph-based collaborative filtering techniques have emerged as a promising recommendation approach by modeling user-item interaction as graphs. Recently, contrastive learning has been employed in graph collaborative through data augmentation, which can effectively offer data efficiency and reduce labeling costs. Nonetheless, most existing contrastive learning approaches overlook the heterogeneous auxiliary information pertaining to users and items, such as user social relationships and item categories, which are crucial to alleviate the data sparsity issue. In this paper, we propose a novel contrastive learning method, referred to as Heterogeneous Adaptive Preference Learning for Recommendation (HAPLRec), which explicitly incorporates fine-grained preference information from both users and items. Specifically, we construct user relationship graphs and item relationship graphs based on specific meta-paths in a heterogeneous graph. Subsequently, we conduct data augmentation on these graphs individually to obtain auxiliary contrastive tasks. Moreover, we introduce an optimization algorithm that leverages the gradient similarity between the main task and the auxiliary tasks, dynamically adjusting the weight assigned to each task to expedite achieving superior performance within a shorter time frame. The effectiveness of the proposed model is demonstrated through extensive experiments conducted on three publicly available datasets.
Keywords:
Heterogeneous information network
contrastive learning
graph neural network
multi-task learning
Journal
A
IF:
0
Papers:
16
Citations:
0