.png){kind=icon}
返回
A deeper graph neural network for recommender systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2019.105020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Interaction data in recommender systems are usually represented by a bipartite user-item graph whose edges represent interaction behavior between users and items. The data sparsity problem, which is common in recommender systems, is the result of insufficient interaction data in the link prediction on graphs. The data sparsity problem can be alleviated by extracting more interaction behavior from the bipartite graph, however, stacking multiple layers will lead to over-smoothing, in which case, all nodes will converge to the same value. To address this issue, we propose a deeper graph neural network in this paper that can predict links on a bipartite user-item graph using information propagation. An attention mechanism is introduced to our method to address the problem that variable size inputs for each node on a bipartite graph. Our experimental results demonstrate that our proposed method outperforms five baselines, suggesting that the interactions extracted help to alleviate the data sparsity problem and improve recommendation accuracy. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Recommender systems
Representation learning
Graph neural network
Collaborative filtering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
.png){kind=icon}
分享收藏Querying Dynamic Wireless Sensor Networks with Non-revisiting Random Walks基于非重访随机游走的动态无线传感器网络查询
PREAI
分享收藏A Fuzzy Preference Tree-Based Recommender System for Personalized Business-to-Business E-Services
OAAI
OAAI分享收藏Collaborative Filtering beyond the User-Item Matrix: A Survey of the State of the Art and Future Challenges超越用户-项目矩阵的协同过滤: 对最新技术和未来挑战的调查
PREAI
分享收藏 没有更多内容
没有更多内容