Graph Neural Network Recommendation Based on Enhanced Social Influence

被引:0
|
作者
Dai X. [1 ]
Ye H. [1 ]
Cao F. [1 ]
机构
[1] Department of Applied Mathematics, College of Sciences, China Jiliang University, Hangzhou
基金
中国国家自然科学基金;
关键词
Graph Neural Network; Mutual Information Maximization; Representation Learning; Social Recommendation;
D O I
10.16451/j.cnki.issn1003-6059.202403003
中图分类号
学科分类号
摘要
With the rapid development of online social platforms, social recommendation becomes a critical task in recommender systems. However, the performance of recommendation systems is limited to some extent due to the sparsity of social relationships between users. Therefore, a graph neural network recommendation method based on enhanced social influence is proposed in the paper, aiming to utilize implicit social relationships between users to enhance social recommendation. The implicit social relationships are revealed, and the social graph among users is reconstructed by analyzing interaction information between users and items. On this basis, global features of the social graph are integrated with local features of users effectively via the mutual information maximization method. A learnable mechanism is integrated into the graph attention network to fully capture the interaction information between users and items. An improved Bayesian personalized ranking loss is designed to provide more accurate user and item feature representations for the rating prediction task. Extensive experiments on three public social recommendation datasets demonstrate the superiority of the proposed method. © 2024 Science Press. All rights reserved.
引用
收藏
页码:221 / 230
页数:9
相关论文
共 34 条
  • [1] Chen H.X., Yin H.Z., Chen T., Et al., Social Boosted Recommendation with Folded Bipartite Network Embedding, IEEE Transactions on Knowledge and Data Engineering, 34, 2, pp. 914-926, (2022)
  • [2] Guo Z.W., Yu K.P., Li Y., Et al., Deep Learning-Embedded Social Internet of Things for Ambiguity-Aware Social Recommendation, IEEE Transactions on Network Science and Engineering, 9, 3, pp. 1067-1081, (2022)
  • [3] Li N., Gao C., Jin D.P., Et al., Disentangled Modeling of Social Homophily and Influence for Social Recommendation, IEEE Transactions on Knowledge and Data Engineering, 35, 6, pp. 5738-5751, (2023)
  • [4] Wang Y., Gao L., Social Circle-Based Algorithm for Friend Recommendation in Online Social Networks, Chinese Journal of Computers, 37, 4, pp. 801-808, (2014)
  • [5] McPherson M., Smith-Lovin L., Cook J.M., Birds of a Feather: Homophily in Social Networks, Annual Review of Sociology, 27, pp. 415-444, (2001)
  • [6] Marsden P.V., Friedkin N.E., Network Studies of Social Influence, Sociological Methods Research, 22, 1, pp. 127-151, (1993)
  • [7] Leng Y.J., Lu Q., Liang C.Y., Survey of Recommendation Based on Collaborative Filtering, Pattern Recognition and Artificial Intelligence, 27, 8, pp. 720-734, (2014)
  • [8] Ma H., Yang H.X., Lyu M.R., Et al., SoRec: Social Recommendation Using Probabilistic Matrix Factorization, Proc of the 17th ACM International Conference on Information and Knowledge Management, pp. 931-940, (2008)
  • [9] 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)
  • [10] Jamali M., Ester M., A Matrix Factorization Technique with Trust Propagation for Recommendation in Social Networks, Proc of the 4th ACM Conference on Recommender Systems, pp. 135-142, (2010)