Collaborative Filtering Recommendation Algorithm Based On Bisecting K-Means Clustering
INTERNATIONAL SYMPOSIUM ON ARTIFICIAL INTELLIGENCE AND ROBOTICS 2020(2020)
摘要
The traditional collaborative filtering recommendation algorithm has the problem of data sparsity and expansibility. Aiming at this problem, and improved bisecting k-means collaborative filtering algorithm proposed.The algorithm first removes unrated items in the rating data matrix based on the Weighted Slope One algorithm preprocessing to reduce its sparsity. Then the preprocessed rating data is clustered based on the bisecting K-means algorithm, which reduces the nearest neighbor search space of the target user by assembling similar objects, thereby improving the algorithm's expansibility. Finally, use the recommendation algorithm to generate the final result.Experimental results show that the improved bisecting k-means algorithm improves the recommendation effect.
更多查看译文
关键词
Collaborative filtering, Recommendation algorithm, Weighted Slope One, Bisecting k-means clustering
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络