Hierarchical Hyperedge Embedding-Based Representation Learning for Group Recommendation

Author:

Guo Lei1,Yin Hongzhi2ORCID,Chen Tong2,Zhang Xiangliang3ORCID,Zheng Kai4

Affiliation:

1. Shandong Normal University, Jinan, China

2. The University of Queensland, Brisbane, QLD, Australia

3. King Abdullah University of Science and Technology, Thuwal, Saudi Arabia

4. University of Electronic Science and Technology of China, Chengdu, China

Abstract

Group recommendation aims to recommend items to a group of users. In this work, we study group recommendation in a particular scenario, namely occasional group recommendation, where groups are formed ad hoc and users may just constitute a group for the first time—that is, the historical group-item interaction records are highly limited. Most state-of-the-art works have addressed the challenge by aggregating group members’ personal preferences to learn the group representation. However, the representation learning for a group is most complex beyond the aggregation or fusion of group member representation, as the personal preferences and group preferences may be in different spaces and even orthogonal. In addition, the learned user representation is not accurate due to the sparsity of users’ interaction data. Moreover, the group similarity in terms of common group members has been overlooked, which, however, has the great potential to improve the group representation learning. In this work, we focus on addressing the aforementioned challenges in the group representation learning task, and devise a hierarchical hyperedge embedding-based group recommender, namely HyperGroup. Specifically, we propose to leverage the user-user interactions to alleviate the sparsity issue of user-item interactions, and design a graph neural network-based representation learning network to enhance the learning of individuals’ preferences from their friends’ preferences, which provides a solid foundation for learning groups’ preferences. To exploit the group similarity (i.e., overlapping relationships among groups) to learn a more accurate group representation from highly limited group-item interactions, we connect all groups as a network of overlapping sets (a.k.a. hypergraph), and treat the task of group preference learning as embedding hyperedges (i.e., user sets/groups) in a hypergraph, where an inductive hyperedge embedding method is proposed. To further enhance the group-level preference modeling, we develop a joint training strategy to learn both user-item and group-item interactions in the same process. We conduct extensive experiments on two real-world datasets, and the experimental results demonstrate the superiority of our proposed HyperGroup in comparison to the state-of-the-art baselines.

Funder

National Natural Science Foundation of China

ARC Discovery Project

China Postdoctoral Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,General Business, Management and Accounting,Information Systems

Reference68 articles.

1. Group recommendation

2. Yunsheng Bai Hao Ding Yang Qiao Agustin Marinovic Ken Gu Ting Chen Yizhou Sun and Wei Wang. 2019. Unsupervised inductive graph-level representation learning via graph-graph proximity. arxiv:1904.01098 [cs.LG]. Yunsheng Bai Hao Ding Yang Qiao Agustin Marinovic Ken Gu Ting Chen Yizhou Sun and Wei Wang. 2019. Unsupervised inductive graph-level representation learning via graph-graph proximity. arxiv:1904.01098 [cs.LG].

3. Group recommendations with rank aggregation and collaborative filtering

4. Representation Learning: A Review and New Perspectives

Cited by 57 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3