Multi-channel graph attention network with disentangling capability for social recommendation

被引：0

作者：

Hong M. ^{[1
,2
]}

Wang J. ^{[1
,2
]}

Jia C. ^{[1
,2
]}

机构：

[1] School of Computer and Information Technology, Beijing Jiaotong University, Beijing

[2] Beijing Key Laboratory of Traffic Data Analysis and Mining, Beijing Jiaotong University, Beijing

来源：

Guofang Keji Daxue Xuebao/Journal of National University of Defense Technology | 2022年 / 44卷 / 03期

关键词：

Attention network; Deep clustering; Graph neural network; Recommendation system; Social network;

D O I：

10.11887/j.cn.202203001

中图分类号：

学科分类号：

摘要：

A Multi-channel graph attention network social recommendation model with disentangling capability was proposed. This model mainly included three modules: the deep clustering module, the aggregation module based on multi-channel graph attention network, and the rating prediction module. Among them, the deep clustering module was used to group users and items. The clustering results can be used to split user-user social graph and user-item interaction graph into multiple subgraph to learn user interest groups and users' interests in different types of items. The aggregation module learns the attention of different sub-graphs to the prediction results. The rating prediction module input the learned user representation vector and item representation vector into the multilayer perceptron for rating prediction. Extensive experiments on multiple real-world datasets demonstrate that the proposed method is better than other social recommendation algorithms. Specifically, compared with the latest graph neural networks method for social recommendation, the root mean square error is respectively reduced by 2.26% and 2.07% on the Ciao and Epinions datasets, and the mean absolute error is respectively reduced by 2.58% and 3.06%. © 2022, NUDT Press. All right reserved.

引用

页码：1 / 9

页数：8

共 27 条

[1]

ISINKAYE F O, FOLAJIMI Y O, OJOKOH B A., Recommendation systems: principles, methods and evaluation, Egyptian Informatics Journal, 16, 3, pp. 261-273, (2015)

[2]

KHUSRO S, ALI Z, ULLAH I., Recommender systems: issues, challenges, and research opportunities, Proceedings of Information Science and Applications (ICISA), (2016)

[3]

TANG J L, HU X, LIU H., Social recommendation: a review, Social Network Analysis and Mining, 3, pp. 1113-1133, (2013)

[4]

KING I, LYU M R, MA H., Introduction to social recommendation, Proceedings of the 19th International Conference on World Wide Web, pp. 1355-1356, (2010)

[5]

YANG B, LEI Y, LIU J M, Et al., Social collaborative filtering by trust, IEEE Transactions on Pattern Analysis and Machine Intelligence, 39, 8, pp. 1633-1647, (2017)

[6]

MA H, YANG H X, LYU M R, Et al., SoRec: social recommendation using probabilistic matrix factorization, Proceedings of the 17th ACM Conference on Information and Knowledge Management, pp. 931-940, (2008)

[7]

GU Y L, SONG J X, LIU W D, Et al., CAMF: context aware matrix factorization for social recommendation, Web Intelligence, 16, 1, pp. 53-71, (2018)

[8]

MA H, ZHOU D Y, LIU C, Et al., Recommender systems with social regularization, Proceedings of the 4th ACM International Conference on Web Search and Data Mining, pp. 287-296, (2011)

[9]

JAMALI M, ESTER M., A matrix factorization technique with trust propagation for recommendation in social networks, Proceedings of the 4th ACM Conference on Recommender Systems, pp. 135-142, (2010)

[10]

FAN W, LI Q, CHENG M., Deep modeling of social relations for recommendation, Proceedings of Thirty-Second AAAI Conference on Artificial Intelligence (AAAI-18), 32, 1, pp. 8075-8076, (2018)

← 1 2 3 →