Self-supervised Graph Learning for Occasional Group Recommendation
원문 초록
As an important branch in Recommender System, occasional group recommendation has received more and more attention. In this scenario, each occasional group (cold-start group) has no or few historical interacted items. As each occasional group has extremely sparse interactions with items, traditional group recommendation methods can not learn high-quality group representations. The recent proposed Graph Neural Networks (GNNs), which incorporate the high-order neighbors of the target occasional group, can alleviate the above problem in some extent. However, these GNNs still can not explicitly strengthen the embedding quality of the high-order neighbors with few interactions. Motivated by the Self-supervised Learning technique, which is able to find the correlations within the data itself, we propose a self-supervised graph learning framework, which takes the user/item/group embedding reconstruction as the pretext task to enhance the embeddings of the cold-start users/items/groups. In order to explicitly enhance the high-order cold-start neighbors' embedding quality, we further introduce an embedding enhancer, which leverages the self-attention mechanism to improve the embedding quality for them. Comprehensive experiments show the advantages of our proposed framework than the state-of-the-art methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SGCL: Unifying Self-Supervised and Supervised Learning for Graph Recommendation
A Unified Framework against Topology and Class Imbalance
NLGCL: Naturally Existing Neighbor Layers Graph Contrastive Learning for Recommendation
Boosting Generative Adversarial Transferability with Self-supervised Vision Transformer Features
Topology-Aware Modeling for Unsupervised Simulation-to-Reality Point Cloud Recognition
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.