Collaborative Filtering Recommendation Algorithm Based on Bisecting K-means Clustering

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.