Adaptive High-order Implicit Relations Modeling for Social Recommendation

被引：0
作者：
Li S.-Y. [1 ]
Meng D. [2 ]
Kong C. [1 ]
Zhang L.-P. [1 ]
Xu C. [3 ]
机构：
[1] School of Computer and Information, Anhui Polytechnic University, Wuhu
[2] AI Institute, Tongdun Technology Co. Ltd., Shanghai
[3] School of Data Science and Engineering, East China Normal University, Shanghai
来源：
Ruan Jian Xue Bao/Journal of Software | 2023年 / 34卷 / 10期
关键词：
adaptive random walk; graph convolutional network (GCN); high-order implicit relations modeling; social network; social recommendation;
D O I：
10.13328/j.cnki.jos.006662
中图分类号：
学科分类号：
摘要：
Recent research studies on social recommendation have focused on the joint modeling of the explicit and implicit relations in social networks and overlooked the special phenomenon that high-order implicit relations are not equally important to each user. The importance of high-order implicit relations to users with plenty of neighbors differs greatly from that to users with few neighbors. In addition, due to the randomness of social relation construction, explicit relations are not always available. This study proposes a novel adaptive high-order implicit relations modeling (AHIRM) method, and the model consists of three components. Specifically, unreliable relations are filtered, and potential reliable relations are identified, thereby mitigating the adverse effects of unreliable relations and alleviating the data sparsity issue. Then, an adaptive random walk algorithm is designed to capture neighbors at different orders for users according to normalized node centrality, construct high-order implicit relations among the users, and ultimately reconstruct the social network. Finally, the graph convolutional network (GCN) is employed to aggregate information about neighbor nodes. User embeddings are thereby updated to model the high-order implicit relations and further alleviate the data sparsity issue. The influence of social structure and personal preference are both considered during modeling, and the process of social influence propagation is simulated and retained. Comparative verification of the proposed model and the existing algorithms are conducted on the LastFM, Douban, and Gowalla datasets, and the results verify the effectiveness and rationality of the proposed AHIRM model. © 2023 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：4851 / 4869
页数：18
相关论文
共 38 条
  • [31] Dahl RA., Freedom and control in modern society, American Sociological Review, 19, 6, pp. 807-808, (1954)
  • [32] Kingma DP, Ba J., Adam: A method for stochastic optimization, Proc. of the 3rd Int’l Conf. on Learning Representations, (2015)
  • [33] Rendle S, Freudenthaler C, Gantner Z, Schmidt-Thieme L., BPR: Bayesian personalized ranking from implicit feedback, Proc. of the 25th Conf. on Uncertainty in Artificial Intelligence, pp. 452-461, (2009)
  • [34] Zhao T, McAuley J, King I., Leveraging social connections to improve personalized ranking for collaborative filtering, Proc. of the 23rd ACM Int’l Conf. on Information and Knowledge Management, pp. 261-270, (2014)
  • [35] Yu JL, Gao M, Li JD, Yin HZ, Liu H., Adaptive implicit friends identification over heterogeneous network for social recommendation, Proc. of the 27th ACM Int’l Conf. on Information and Knowledge Management, pp. 357-366, (2018)
  • [36] Yu JL, Gao M, Yin HZ, Li JD, Gao CM, Wang QY., Generating reliable friends via adversarial training to improve social recommendation, Proc. of the 2019 IEEE Int’l Conf. on Data Mining, pp. 768-777, (2019)
  • [37] He XN, Deng K, Wang X, Li Y, Zhang YD, Wang M., LightGCN: Simplifying and powering graph convolution network for recommendation, Proc. of the 43rd Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval, pp. 639-648, (2020)
  • [38] Yu JL, Yin HZ, Li JD, Gao M, Huang Z, Cui LZ., Enhancing social recommendation with adversarial graph convolutional networks, IEEE Trans. on Knowledge and Data Engineering, 34, 8, pp. 3727-3739, (2022)
1234