Dependency Relationships-Enhanced Attentive Group Recommendation in HINs
Juntao Zhang, Sheng Wang, Zhiyu Chen, Xiandi Yang, Zhiyong Peng

TL;DR
This paper introduces DREAGR, a novel group recommendation model that leverages dependency relationships between items and path-aware attention to improve recommendation accuracy for groups, especially under data sparsity.
Contribution
The paper proposes a new method that incorporates item dependency relationships and path-aware attention to enhance group recommendation performance in HINs.
Findings
DREAGR outperforms state-of-the-art models in HR@N and NDCG@N metrics.
Dependency relationships help alleviate interaction sparsity.
Path-aware attention improves user preference modeling.
Abstract
Recommending suitable items to a group of users, commonly referred to as the group recommendation task, is becoming increasingly urgent with the development of group activities. The challenges within the group recommendation task involve aggregating the individual preferences of group members as the group's preferences and facing serious sparsity problems due to the lack of user/group-item interactions. To solve these problems, we propose a novel approach called Dependency Relationships-Enhanced Attentive Group Recommendation (DREAGR) for the recommendation task of occasional groups. Specifically, we introduce the dependency relationship between items as side information to enhance the user/group-item interaction and alleviate the interaction sparsity problem. Then, we propose a Path-Aware Attention Embedding (PAAE) method to model users' preferences on different types of paths. Next,…
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 Technologies in Various Fields · Advanced Bandit Algorithms Research
