HGRec: Group Recommendation With Hypergraph Convolutional Networks

被引:8
作者
Wang, Nan [1 ]
Liu, Dan [1 ]
Zeng, Jin [1 ]
Mu, Lijin [1 ]
Li, Jinbao [2 ,3 ]
机构
[1] Heilongjiang Univ, Coll Comp Sci & Technol, Harbin 150080, Peoples R China
[2] Qilu Univ Technol, Shandong Artificial Intelligence Inst, Jinan 250014, Peoples R China
[3] Qilu Univ Technol, Sch Math & Stat, Jinan 250353, Peoples R China
关键词
Self-supervised learning; Task analysis; Decision making; Convolutional neural networks; Collaboration; Recommender systems; Aggregates; Contrastive learning; graph neural network; group recommendation; hypergraph convolution; user behavior modelling;
D O I
10.1109/TCSS.2024.3363843
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recommendation systems have shifted from personalization for individual users to consensus for groups as a result of people's growing tendency to join groups to participate in various everyday activities, like family meals and workplace reunions. This is because social networks have made it easier for people to participate in these kinds of events. Group recommendation is the process of suggesting items to groups. To derive group preferences, the majority of current approaches combine the individual preferences of group members utilizing heuristic or attention mechanism-based techniques. These approaches, however, have three issues. First, these approaches ignore the complex high-order interactions that occur both inside and outside of groups, just modeling the preferences of individual groups of users. Second, a group's ultimate decision is not always determined by the members' preferences. Nevertheless, current approaches are not adequate to represent such preferences across groups. Last, data sparsity affects group recommendations due to the sparsity of group-item interactions. To overcome the aforementioned constraints, we propose employing hypergraph convolutional networks for group recommendation. Specifically, our design aims to achieve excellent group preferences by establishing a high-order preference extraction view represented by the hypergraph, a consistent preference extraction view represented by the overlap graph, and a conventional preference extraction view represented by the bipartite graph. The linkages between the three various views are then established by using cross-view contrastive learning, and the information between different views can be complementary, thereby improving each other. Comprehensive experiments on three publicly available datasets show that our method performs better than the state-of-the-art baseline.
引用
收藏
页码:4214 / 4225
页数:12
相关论文
共 37 条
[1]  
Amer-Yahia S., 2009, PROC VLDB ENDOW, V2, P754, DOI DOI 10.14778/1687627.1687713
[2]  
Baltrunas Linas, 2010, RECSYS, P119
[3]  
Bandyopadhyay S., 2020, ARXIV
[4]  
Berkovsky S., 2010, RECSYS 10 PROC 4 ACM, P111
[5]   Social-Enhanced Attentive Group Recommendation [J].
Cao, Da ;
He, Xiangnan ;
Miao, Lianhai ;
Xiao, Guangyi ;
Chen, Hao ;
Xu, Jiao .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (03) :1195-1209
[6]   Attentive Group Recommendation [J].
Cao, Da ;
He, Xiangnan ;
Miao, Lianhai ;
An, Yahui ;
Yang, Chao ;
Hong, Richang .
ACM/SIGIR PROCEEDINGS 2018, 2018, :645-654
[7]  
Cao Y., 2023, ARXIV
[8]  
Chen T, 2020, PR MACH LEARN RES, V119
[9]   Thinking inside The Box: Learning Hypercube Representations for Group Recommendation [J].
Chen, Tong ;
Yin, Hongzhi ;
Long, Jing ;
Nguyen, Quoc Viet Hung ;
Wang, Yang ;
Wang, Meng .
PROCEEDINGS OF THE 45TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '22), 2022, :1664-1673
[10]   Knowledge-Aware Group Representation Learning for Group Recommendation [J].
Deng, Zhiyi ;
Li, Changyu ;
Liu, Shujin ;
Ali, Waqar ;
Shao, Jie .
2021 IEEE 37TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2021), 2021, :1571-1582