Self-supervised Graph Learning for Occasional Group Recommendation
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 71 references that are in the map. First posted on arXiv 4 Dec 2021.
Builds on
26 of 71 references.
References · 26
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2016Matching Networks for One Shot Learningcited by 2,255
- 2017Deep Setscited by 1,421
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2019Neural Graph Collaborative Filteringcited by 661
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 584
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 463
14 more
- 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2020GPT-GNN: Generative Pre-Training of Graph Neural Networkscited by 303
- 2021Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendationcited by 101
- 2018NAIS: Neural Attentive Item Similarity Model for Recommendationcited by 52
- 2020Pre-Training Graph Neural Networks for Cold-Start Users and Items Representationcited by 42
- 2021DA-GCN: A Domain-aware Attentive Graph Convolution Network for Shared-account Cross-domain Sequential Recommendationcited by 34
- 2021Double-Scale Self-Supervised Hypergraph Learning for Group Recommendationcited by 32
- 2019Few-Shot Representation Learning for Out-Of-Vocabulary Wordscited by 30
- 2020Overcoming Data Sparsity in Group Recommendationcited by 22
- 2020GroupIM: A Mutual Information Maximization Framework for Neural Group Recommendationcited by 21
- 2021Hierarchical Hyperedge Embedding-based Representation Learning for Group Recommendationcited by 17
- 2018Interact and Decide: Medley of Sub-Attention Networks for Effective Group Recommendationcited by 10
- 2020Recommending Courses in MOOCs for Jobs: An Auto Weak Supervision Approachcited by 3
Built on by
Not cited yet.