Multi-behavior recommendation with SVD Graph Neural Networks

被引:6
作者
Fu, Shengxi [1 ]
Ren, Qianqian [1 ]
Lv, Xingfeng [1 ]
Li, Jinbao [2 ]
机构
[1] Heilongjiang Univ, Dept Comp Sci & Technol, Harbin 150080, Peoples R China
[2] Qilu Univ Technol, Shandong Artificial Intelligence Inst, Sch Math & Stat, Jinan 250014, Peoples R China
基金
中国博士后科学基金;
关键词
Multi-behavior recommendation; Contrastive learning; Graph Neural Networks; Singular value decomposition;
D O I
10.1016/j.eswa.2024.123575
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Graph Neural Networks (GNNs) have been extensively employed in the field of recommendation systems, offering users personalized recommendations and yielding remarkable outcomes. Recently, GNNs incorporating contrastive learning have demonstrated promising performance in handling the sparse data problem of recommendation systems. However, existing contrastive learning methods still have limitations in resisting noise interference, especially for multi-behavior recommendation. To mitigate the aforementioned issues, this paper proposes a GNN-based multi-behavior recommendation model called MB-SVD that utilizes Singular Value Decomposition (SVD) graphs to enhance model performance. In particular, MB-SVD considers user preferences across different behaviors, improving recommendation effectiveness. First, MB-SVD integrates the representation of users and items under different behaviors with learnable weight scores, which efficiently considers the influence of different behaviors. Then, MB-SVD generates augmented graph representation with global collaborative relations. Next, we simplify the contrastive learning framework by directly contrasting original representation with the enhanced representation using the InfoNCE loss. Through extensive experimentation, the remarkable performance of our proposed MB-SVD approach in multi-behavior recommendation endeavors across diverse real-world datasets is exhibited.
引用
收藏
页数:9
相关论文
共 32 条
[1]  
Cai XH, 2023, Arxiv, DOI arXiv:2302.08191
[2]  
Chen C, 2021, AAAI CONF ARTIF INTE, V35, P3958
[3]  
Chen C, 2020, AAAI CONF ARTIF INTE, V34, P19
[4]   Efficient Neural Matrix Factorization without Sampling for Recommendation [J].
Chen, Chong ;
Min, Zhang ;
Zhang, Yongfeng ;
Liu, Yiqun ;
Ma, Shaoping .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2020, 38 (02)
[5]  
Gao C, 2022, Arxiv, DOI [arXiv:2109.12843, DOI 10.1145/3568022]
[6]   Neural Multi-Task Recommendation from Multi-Behavior Data [J].
Gao, Chen ;
He, Xiangnan ;
Gan, Dahua ;
Chen, Xiangning ;
Feng, Fuli ;
Li, Yong ;
Chua, Tat-Seng ;
Jin, Depeng .
2019 IEEE 35TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING (ICDE 2019), 2019, :1554-1557
[7]  
Gu SY, 2022, PROCEEDINGS OF THE THIRTY-FIRST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2022, P2052
[8]  
Gutmann M., 2010, Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, P297
[9]   Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions [J].
Halko, N. ;
Martinsson, P. G. ;
Tropp, J. A. .
SIAM REVIEW, 2011, 53 (02) :217-288
[10]   LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation [J].
He, Xiangnan ;
Deng, Kuan ;
Wang, Xiang ;
Li, Yan ;
Zhang, Yongdong ;
Wang, Meng .
PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, :639-648