.png){kind=icon}
返回
Decentralized Collaborative Filtering Algorithms Based on Complex Network Modeling and Degree Centrality
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.3017701.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given that everyone online is saturated with information, the theoretical significance of recommendation algorithms is evident in the fact that users need help finding products and content they care about. Collaborative filtering predicts a user's rating on an item by finding similar users that rated the item or similar items that were rated by the user, and using the selected similar neighbors to collaboratively filter the recommendation. In the process, selected neighbors are considered equally important despite their differences in popularity. Here, we explore a method of modeling recommender systems as networks that can be constructed by considering items as nodes and similarity between them as links. Our research shows that item centrality has a negative impact on the accuracy of rating predictions, which needs to be considered for better algorithm performance. Experiments show that collaborative filtering algorithms can be decentralized by our method and provide a better accuracy of rating prediction. Furthermore, the relationship between the prediction target and its neighbors can be further evaluated based on both their similarity and their centrality.
Keyword:
Recommender systems
complex networks
decentralized collaborative filtering
degree centrality
network modeling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions走向下一代推荐系统: 对最新技术和可能扩展的调查
PREAI
分享收藏
查看更多内容