English

Self-supervised Graph Learning for Occasional Group Recommendation

Information Retrieval 2022-07-22 v4 Artificial Intelligence

Abstract

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.

Keywords

Cite

@article{arxiv.2112.02274,
  title  = {Self-supervised Graph Learning for Occasional Group Recommendation},
  author = {Bowen Hao and Hongzhi Yin and Cuiping Li and Hong Chen},
  journal= {arXiv preprint arXiv:2112.02274},
  year   = {2022}
}

Comments

This paper uses self-supervised learning technique to enhance the embeddings of users/groups/items, the idea is novel in group recommendation scenario. However, some presentations need to be revised, so as to let the readers understand

R2 v1 2026-06-24T08:04:03.283Z