.png){kind=icon}
返回
Category Preferred Canopy-K-means based Collaborative Filtering algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2018.04.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It is the era of information explosion and overload. The recommender systems can help people quickly get the expected information when facing the enormous data flood. Therefore, researchers in both industry and academia are also paying more attention to this area. The Collaborative Filtering Algorithm (CF) is one of the most widely used algorithms in recommender systems. However, it has difficulty in dealing with the problems of sparsity and scalability of data. This paper presents Category Preferred Canopy-K-means based Collaborative Filtering Algorithm (CPCKCF) to solve the challenges of sparsity and scalability of data. In particular, CPCKCF proposes the definition of the User-Item Category Preferred Ratio (UICPR), and use it to compute the UICPR matrix. The results can be applied to cluster the user data and find the nearest users to obtain prediction ratings. Our experimentation results performed using the MovieLens data set demonstrates that compared with traditional user-based Collaborative Filtering algorithm, the proposed CPCKCF algorithm proposed in this paper improved computational efficiency and recommendation accuracy by 2.81%. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Recommender system
Collaborative Filtering
Data mining
Category preferred ratio
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.8K
被引数:
2.3W
机构
引用论文
.png){kind=icon}
查看更多内容