Recommendation Method Based on Multi-view Embedding Fusion for HINs

被引：0
|
作者：
Shi L.-H. [1 ]
Kou Y. [1 ]
Shen D.-R. [1 ]
Nie T.-Z. [1 ]
Li D. [2 ]
机构：
[1] School of Computer Science and Engineering, Northeastern University, Shenyang
[2] College of Information, Liaoning University, Shenyang
来源：
Ruan Jian Xue Bao/Journal of Software | 2022年 / 33卷 / 10期
关键词：
attention mechanism; graph convolutional network (GCN); heterogeneous information network (HIN); multi-view embedding fusion; recommendation;
D O I：
10.13328/j.cnki.jos.006632
中图分类号：
学科分类号：
摘要：
HINs (heterogeneous information networks) have rich semantic information, which are widely used in recommendation tasks. Traditional recommendation methods for heterogeneous information networks ignore the heterogeneity of association relationships and the interaction between different association types. In this study, a recommendation model based on multi-view embedding fusion is proposed, which can effectively guarantee the accuracy of recommendation by mining the deep potential features of networks from the view of homogenous association and heterogeneous association respectively. For the view of homogenous association, a graph convolutional network (GCN)-based embedding fusion method is proposed. The local fusion of node embeddings is realized through the lightweight convolution of neighborhood information under the action of homogeneous associations. For the view of heterogeneous association, an attention-based embedding fusion method is proposed, which uses attention mechanism to distinguish the influence of different association types on node embedding, and realizes the global fusion of node embedding. The feasibility and effectiveness of the key technology proposed in this study are verified by experiments. © 2022 Chinese Academy of Sciences. All rights reserved.
引用
收藏
页码：3619 / 3634
页数：15
相关论文
共 21 条
  • [1] Perozzi B, Al-Rfou R, Skiena S., Deepwalk: Online learning of social representations, Proc. of the 20th ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pp. 701-710, (2014)
  • [2] Grover A, Leskovec J., node2vec: Scalable feature learning for networks, Proc. of the 22nd ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pp. 855-864, (2016)
  • [3] Dong Y, Chawla NV, Swami A., Metapath2vec: Scalable representation learning for heterogeneous networks, Proc. of the 23rd ACM SIGKDD Int’l Conf. on Knowledge Discovery and Data Mining, pp. 135-144, (2017)
  • [4] Ying R, He R, Chen K, Et al., Graph convolutional neural networks for Web-scale recommender systems, Proc. of the 24th ACM SIGKDD Int’l Conf. on Knowledge Discovery & Data Mining, pp. 974-983, (2018)
  • [5] Wang X, He X, Wang M, Et al., Neural graph collaborative filtering, Proc. of the 42nd Int’l ACM SIGIR Conf. on Research and Development in Information Retrieval, pp. 165-174, (2019)
  • [6] Berg R, Kipf TN, Welling M., Graph convolutional matrix completion, (2017)
  • [7] Chen L, Wu L, Hong R, Et al., Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach, Proc. of the AAAI Conf. on Artificial Intelligence, (2020)
  • [8] He X, Deng K, Wang X, Et al., 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)
  • [9] Velickovic P, Cucurull G, Casanova A, Et al., Graph attention networks, (2017)
  • [10] Cen Y, Zou X, Zhang J, Et al., Representation learning for attributed multiplex heterogeneous network, Proc. of the 25th ACM SIGKDD Int’l Conf. on Knowledge Discovery & Data Mining, pp. 1358-1368, (2019)
123