Computer and Modernization

Previous Articles     Next Articles

Optimization of Slope One Algorithm Based on Clustering and Project Similarity

  

  1. (College of Computer Science, Beijing University of Technology, Beijing 100124, China)
  • Received:2016-01-12 Online:2016-08-18 Published:2016-08-11

Abstract: With the growth of number of users, the user item matrix becomes more and more sparse. K-means algorithm based on minimum spanning tree of the project is used to cluster the items. The clustered results for the user rating matrix are used to predict filling. Taking into account the user interest change in Slope One algorithm, time weight added to the Slope One algorithm is used to predict rating. Experiments on the Movie Lens dataset show that the improved algorithm effectively solves the sparse and user interest change problem and the MAE value is reduced to less than 0.015.

Key words: Slope One, k-means, sparsity, interest change

CLC Number: