SGNNRec: A Scalable Double-Layer Attention-Based Graph Neural Network Recommendation Model

被引:0
作者
He, Jing [1 ,2 ]
Tang, Le [1 ]
Tang, Dan [1 ]
Wang, Ping [1 ]
Cai, Li [1 ]
机构
[1] Yunnan Univ, Natl Pilot Sch Software, Kunming 650500, Yunnan, Peoples R China
[2] Yunnan Univ, Engn Res Ctr Cyberspace, Kunming 650500, Yunnan, Peoples R China
基金
中国国家自然科学基金;
关键词
Recommendation system; Graph neural network; Double-layer attention network; Auxiliary information;
D O I
10.1007/s11063-024-11555-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Due to the information from the multi-relationship graphs is difficult to aggregate, the graph neural network recommendation model focuses on single-relational graphs (e.g., the user-item rating bipartite graph and user-user social relationship graphs). However, existing graph neural network recommendation models have insufficient flexibility. The recommendation accuracy instead decreases when low-quality auxiliary information is aggregated in the recommendation model. This paper proposes a scalable graph neural network recommendation model named SGNNRec. SGNNRec fuse a variety of auxiliary information (e.g., user social information, item tag information and user-item interaction information) beside user-item rating as supplements to solve the problem of data sparsity. A tag cluster-based item-semantic graph method and an apriori algorithm-based user-item interaction graph method are proposed to realize the construction of graph relations. Furthermore, a double-layer attention network is designed to learn the influence of latent factors. Thus, the latent factors are to be optimized to obtain the best recommendation results. Empirical results on real-world datasets verify the effectiveness of our model. SGNNRec can reduce the influence of poor auxiliary information; moreover, with increasing the number of auxiliary information, the model accuracy improves.
引用
收藏
页数:21
相关论文
共 28 条
[1]  
Barkan Oren, 2016, IEEE INT WORKSHOP MA
[2]  
[蔡强 Cai Qiang], 2014, [计算机科学, Computer Science], V41, P69
[3]   The problem of information overload in business organisations: a review of the literature [J].
Edmunds, A ;
Morris, A .
INTERNATIONAL JOURNAL OF INFORMATION MANAGEMENT, 2000, 20 (01) :17-28
[4]  
Ester Martin., 1996, P ACM SIGKDD INT C K, V96, P226, DOI DOI 10.5555/3001460.3001507
[5]   Graph Neural Networks for Social Recommendation [J].
Fan, Wenqi ;
Ma, Yao ;
Li, Qing ;
He, Yuan ;
Zhao, Eric ;
Tang, Jiliang ;
Yin, Dawei .
WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, :417-426
[6]   HetETA: Heterogeneous Information Network Embedding for Estimating Time of Arrival [J].
Hong, Huiting ;
Lin, Yucheng ;
Yang, Xiaoqing ;
Li, Zang ;
Fu, Kung ;
Wang, Zheng ;
Qie, Xiaohu ;
Ye, Jieping .
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, :2444-2454
[7]   DiffNet: A Learning to Compare Deep Network for Product Recognition [J].
Hu, Bin ;
Zhou, Nuoya ;
Zhou, Qiang ;
Wang, Xinggang ;
Liu, Wenyu .
IEEE ACCESS, 2020, 8 :19336-19344
[8]   An Efficient Neighborhood-based Interaction Model for Recommendation on Heterogeneous Graph [J].
Jin, Jiarui ;
Qin, Jiarui ;
Fang, Yuchen ;
Du, Kounianhua ;
Zhang, Weinan ;
Yu, Yong ;
Zhang, Zheng ;
Smola, Alexander J. .
KDD '20: PROCEEDINGS OF THE 26TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY & DATA MINING, 2020, :75-84
[9]   An efficient k-means clustering algorithm:: Analysis and implementation [J].
Kanungo, T ;
Mount, DM ;
Netanyahu, NS ;
Piatko, CD ;
Silverman, R ;
Wu, AY .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (07) :881-892
[10]  
Hamilton WL, 2018, Arxiv, DOI arXiv:1706.02216