Multi-level Noise Filtering and Preference Propagation Enhanced Knowledge Graph Recommendation.

Ge Zhao, Shuaishuai Zu,Li Li,Zhisheng Yang

Advanced Data Mining and Applications: 19th International Conference, ADMA 2023, Shenyang, China, August 21–23, 2023, Proceedings, Part I(2023)

引用 0|浏览1
暂无评分
摘要
Knowledge Graph (KG) can provide semantic information about items, which can be used to mitigate the sparsity problem in recommendation systems. In recent years, the trend in knowledge-aware recommendation methods has been to leverage Graph Neural Networks (GNNs) to aggregate node information in KG. However, many of these methods focus on mining the item knowledge association on KG, but ignore the potential item auxiliary information in user’s history interaction outside KG. Furthermore, these methods equally aggregate all neighbor entities of the item on KG, which will inevitably introduce irrelevant entity-interaction behaviors. To address these issues, we propose a novel model, called Multi-level Noise Filtering and Preference Propagation Enhanced Recommendation (MNFP). Technically, we employ self-attention mechanisms to model the user’s interaction sequence to mine the item’s auxiliary information. Then, we design a twin-tower preference propagation mechanism that iteratively expands item auxiliary information on KG. Additionally, we propose a multi-level noise filtering mechanism. By learning the relationship consistency between the item and its neighbor entities, the model can guide the item to selectively link highly related neighbors in preference propagation, thus reducing the introduction of noise. We evaluate MNFP on three real-world datasets: MovieLens-1M, Last.FM and Book-Crossing. Results show that MNFP significantly outperforms state-of-the-art methods on AUC and F1 .
更多
查看译文
关键词
knowledge graph,filtering,propagation,multi-level
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要