Category Preferred Canopy–K-means based Collaborative Filtering algorithm

Abstract

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%.