4.6 Article

An improved clustering-based collaborative filtering recommendation algorithm

出版社

SPRINGER
DOI: 10.1007/s10586-017-0807-6

关键词

Clustering; Collaborative filtering; Time decay; Interest vector

资金

  1. Scientific Research Program of Educational Commission of Hubei Province of China [D20162903]
  2. Scientific Fund Project of Huanggang Normal University [201616103]

向作者/读者索取更多资源

In the circumstance of big data, the traditional collaborative filtering recommendation algorithm in e-commerce system is faced with the problems of data sparse, accuracy, real-time and etc., this paper proposes an improved clustering-based collaborative filtering recommendation algorithm. The algorithm introduces time decay function for preprocessing the user's rating and uses project attribute vectors to characterize projects, user interest vectors to users and use clustering algorithms to cluster the users and the projects respectively. Then the improved similarity measure methods are used to find the user's nearest neighbor and project recommended candidate set in the cluster. Finally, recommendations are produced. Theoretical analysis and experimental results show that the algorithm not only can effectively solve the problems of data sparse and new project, but also can portrait for users in multi dimension and reflect the user's interest changing. The recommended accuracy of the algorithm is improved obviously, too.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据