Overcoming Data Sparsity in Group Recommendation
Hongzhi Yin, Qinyong Wang, Kai Zheng, Zhixu Li, Xiaofang Zhou

TL;DR
This paper introduces CAGR, a novel end-to-end group recommender system that leverages graph embedding, self-attention, and social network data to better model group preferences and address data sparsity issues.
Contribution
The paper proposes CAGR, integrating BGEM, self-attention, and GCNs to improve group recommendation accuracy and handle data sparsity in occasional groups.
Findings
CAGR outperforms state-of-the-art models on large-scale datasets.
Incorporating social network data enhances user representation.
Self-attention effectively models group member influence.
Abstract
It has been an important task for recommender systems to suggest satisfying activities to a group of users in people's daily social life. The major challenge in this task is how to aggregate personal preferences of group members to infer the decision of a group. Conventional group recommendation methods applied a predefined strategy for preference aggregation. However, these static strategies are too simple to model the real and complex process of group decision-making, especially for occasional groups which are formed ad-hoc. Moreover, group members should have non-uniform influences or weights in a group, and the weight of a user can be varied in different groups. Therefore, an ideal group recommender system should be able to accurately learn not only users' personal preferences but also the preference aggregation strategy from data. In this paper, we propose a novel end-to-end group…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Graph Neural Networks · Complex Network Analysis Techniques
MethodsGraph Convolutional Networks
