Self-supervised graph learning for occasional group recommendation

被引:8
作者
Hao, Bowen [1 ]
Yin, Hongzhi [2 ]
Li, Cuiping [3 ]
Chen, Hong [3 ]
机构
[1] Capital Normal Univ, Beijing, Peoples R China
[2] Univ Queensland, Brisbane, Qld, Australia
[3] Renmin Univ China, Beijing, Peoples R China
基金
澳大利亚研究理事会; 中国国家自然科学基金;
关键词
graph neural network; occasional group recommendation; self-supervised learning;
D O I
10.1002/int.23011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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. 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.
引用
收藏
页码:10880 / 10902
页数:23
相关论文
共 55 条
[1]  
Amer-Yahia S, 2009, PROC VLDB ENDOW, V2
[2]  
[Anonymous], 2012, CoRR
[3]  
[Anonymous], 2010, RecSys'10-Proceedings of the 4th ACM Conference on Recommender Systems, DOI [DOI 10.1145/1864708.1864721, 10.1145/1864708.1864721]
[4]  
Baltrunas Linas, 2010, P 4 ACM C REC SYST, P119
[5]  
Boratto L, 2010, STUD COMPUT INTELL, V324, P1
[6]   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
[7]   Attentive Group Recommendation [J].
Cao, Da ;
He, Xiangnan ;
Miao, Lianhai ;
An, Yahui ;
Yang, Chao ;
Hong, Richang .
ACM/SIGIR PROCEEDINGS 2018, 2018, :645-654
[8]  
Chen T., 2022, SIGIR 22
[9]   Comparison of group recommendation algorithms [J].
De Pessemier, Toon ;
Dooms, Simon ;
Martens, Luc .
MULTIMEDIA TOOLS AND APPLICATIONS, 2014, 72 (03) :2497-2541
[10]  
Devlin J, 2019, 2019 CONFERENCE OF THE NORTH AMERICAN CHAPTER OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS: HUMAN LANGUAGE TECHNOLOGIES (NAACL HLT 2019), VOL. 1, P4171