Meta-path guided heterogeneous graph neural networks for news recommendation

被引:0
|
作者
Wang F. [1 ,2 ]
Lin Z. [2 ]
Wu K. [3 ]
Han S. [2 ]
Sun L. [2 ]
Lü X. [1 ,2 ]
机构
[1] Center of Applied Statistics, Renmin University of China, Beijing
[2] School of Statistics, Renmin University of China, Beijing
[3] Recommendation Group, Bytedance, Beijing
基金
中国国家自然科学基金;
关键词
attention; heterogeneous graph neural networks; meta-path; news recommendation;
D O I
10.12011/SETP2023-0313
中图分类号
学科分类号
摘要
News recommendation is an important recommendation scenario, and its effectiveness relies on the thorough exploration of news textual information. In recent years, graph neural networks (GNNs) have gained widespread attention in the field of recommendation due to their powerful ability to mine higher-order information. However, there is limited research on the use of heterogeneous graph neural networks in the field of news recommendation, and existing heterogeneous graph recommendation models also suffer from the problem of information loss. In order to fully exploit the high-level information among news, users, textual topics, entities, and categories in the news recommendation scenario, we propose a meta-path guided neighbors interaction recommendation model (MPNRec) for news recommendation. The MPNRec model builds a heterogeneous graph with more types of nodes and edges fully mine high-level information and improve the performance of news recommendation. On two public datasets (i.e., MIND small and Adressa 1week), the MPNRec model can reach at least a 2% to 5% improvement in recommendation accuracy when compared with state-of-the-art methods. © 2024 Systems Engineering Society of China. All rights reserved.
引用
收藏
页码:1561 / 1576
页数:15
相关论文
共 30 条
  • [1] Konstan J A, Miller B N, Maltz D, Et al., GroupLens: Applying collaborative filtering to usenet news[J], Communications of the ACM, 40, 3, (2000)
  • [2] Ying R, He R, Chen K, Et al., Graph convolutional neural networks for web-scale recommender systems[C], Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 974-983, (2018)
  • [3] Fan S, Zhu J, Han X, Et al., Metapath-guided heterogeneous graph neural network for intent recommendation[C], Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2478-2486, (2019)
  • [4] Jin J, Qin J, Fang Y, Et al., An efficient neighborhood-based interaction model for recommendation on heterogeneous graph[C], Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 75-84, (2020)
  • [5] Ge S, Wu C, Wu F, Et al., Graph enhanced representation learning for news recommendation[C], Proceedings of The Web Conference, pp. 2863-2869, (2020)
  • [6] Hu L, Li C, Shi C, Et al., Graph neural news recommendation with long-term and short-term interest modeling, Information Processing & Management, 57, 2, (2020)
  • [7] Hu L, Xu S, Li C, Et al., Graph neural news recommendation with unsupervised preference disentanglement[C], Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, pp. 4255-4264, (2020)
  • [8] Qu Y, Bai T, Zhang W, Et al., An end-to-end neighborhood-based interaction model for knowledge-enhanced recommendation[C], Proceedings of the 1st International Workshop on Deep Learning Practice for High-Dimensional Sparse Data, pp. 1-9, (2019)
  • [9] Cheng H T, Koc L, Harmsen J, Et al., Wide & deep learning for recommender systems[C], Proceedings of the 1st Workshop on Deep Learning for Recommender Systems, pp. 7-10, (2016)
  • [10] Guo H, Tang R, Ye Y, Et al., DeepFM: A factorization-machine based neural network for CTR prediction, (2017)