A collaborative filtering algorithm based on item labels and Hellinger distance for sparse data

Abstract

The Neighbourhood-based collaborative filtering (CF) algorithm has been widely used in recommender systems. To enhance the adaptability to the sparse data, a CF with new similarity measure and prediction method is proposed. The new similarity measure is designed based on the Hellinger distance of item labels, which overcomes the problem of depending on common-rated items (co-rated items). In the proposed prediction method, we present a new strategy to solve the problem that the neighbour users do not rate the target item, that is, the most similar item rated by the neighbour user is used to replace the target item. The proposed prediction method can significantly improve the utilisation of neighbours and obviously increase the accuracy of prediction. The experimental results on two benchmark datasets both confirm that the proposed algorithm can effectively alleviate the sparse data problem and improve the recommendation results.