A Cluster-Based Similarity Fusion Approach For Scaling-Up Collaborative Filtering Recommender System

Collaborative filtering (cf) recommenders work by collecting user ratings for items in a given domain and computing similarities between users or items to produce recommendations. the user-item rating database is extremely sparse. this means the number of ratings obtained is very small compared with the number of ratings that need to be predicted. cf suffers from the sparsity problem, resulting in poor quality recommendations and reduced coverage. further, a cf algorithm needs calculations that are very expensive and grow non-linearly with the number of users and items in a database. incited by these challenges, we present cluster-based similarity fusion (cbsf), a new hybrid collaborative filtering algorithm which can deal with the sparsity and scalability issues simultaneously. by the use of carefully selected clusters of users and items, cbsf reduces the computational cost of traditional cf, while retaining high accuracy. experimental results demonstrate that apart from being scalable, cbsf leads to a better precision and coverage for the recommendation engine.