Unify Local and Global Information for Top-N Recommendation
Xiaoming Liu, Shaocong Wu, Zhaohan Zhang, Chao Shen
摘要
Knowledge graph (KG), integrating complex information and containing rich semantics, is widely considered as side information to enhance the recommendation systems. However, most of the existing KG-based methods concentrate on encoding the structural information in the graph, without utilizing the collaborative signals in user-item interaction data, which are important for understanding user preferences. Therefore, the representations learned by these models are insufficient for representing semantic information of users and items in the recommendation environment. The combination of both kinds of data provides a good chance to solve this problem, but it faces the following challenges: i) the inner correlations in user-item interaction data are difficult to capture from one side of the user or item; ii) capturing the knowledge associations on the whole KG would introduce noises and variously influence the recommendation results; iii) the semantic gap between both kinds of data is hard to alleviate.
To tackle this research gap, we propose a novel duet representation learning framework named KADM to fuse local information (user-item interaction data) and global information (external knowledge graph) for the top-𝑁 recommendation, which is composed of two separate sub-models. One learns the local representations by discovering the inner correlations in local information with a knowledge-aware co-attention mechanism, and another learns the global representations by encoding the knowledge associations in global information with a relation-aware attention network. The two sub-models are jointly trained as part of the semantic fusion network to compute the user preferences, which discriminates the contribution of the two sub-models under the special context. We conduct experiments on two real-world datasets, and the evaluations show that KADM significantly outperforms state-of-art methods. Further ablation studies confirm that the duet architecture performs significantly better than either sub-model on the recommendation tasks.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper6
- Learning Intents behind Interactions with Knowledge Graph for RecommendationXiang Wang, Tinglin Huang, Dingxian Wang, Yancheng Yuan 等WWW 2021 · 被引用 584 次
- Inductive Relation Prediction by Subgraph ReasoningKomal K. Teru, Etienne G. Denis, William L. HamiltonICML 2020 · 被引用 493 次
- Sequential Recommendation with Graph Neural NetworksJianxin Chang, Chen Gao, Yu Zheng, Yiqun Hui 等SIGIR 2021 · 被引用 435 次
- CKAN: Collaborative Knowledge-aware Attentive Network for Recommender SystemsZe Wang, Guangyan Lin, Huobin Tan, Qinghong Chen 等SIGIR 2020 · 被引用 311 次
- Improving Conversational Recommender Systems via Knowledge Graph based Semantic FusionKun Zhou, Wayne Xin Zhao, Shuqing Bian, Yuanhang Zhou 等KDD 2020 · 被引用 309 次
相关 Paper
- Multi-graph Fusion Cross-model Contrastive Learning for RecommendationShengjun Ma, Yuhai Zhao, Fenglong Ma, Baoyin Liu 等AAAI 2026
- Unleashing the Power of Knowledge Graph for Recommendation via Invariant LearningShuyao Wang, Yongduo Sui, Chao Wang, Hui XiongWWW 2024 · 被引用 33 次
- Knowledge-Enhanced Recommendation with User-Centric Subgraph NetworkGuangyi Liu, Quanming Yao, Yongqi Zhang, Lei ChenICDE 2024 · 被引用 6 次
- UGRec: Modeling Directed and Undirected Relations for RecommendationXinxiao Zhao, Zhiyong Cheng, Lei Zhu, Jiecai Zheng 等SIGIR 2021 · 被引用 18 次
- DCGL: Dual-Channel Graph Learning with Large Language Models for Knowledge-Aware RecommendationXinchi Zou, Tongzhenzhi Su, Jianjun Li, Yuan Fu 等SIGIR 2026
