Novel Neighbor Selection Method to Improve Data Sparsity Problem in Collaborative Filtering

Abstract EN

Memory-based collaborative filtering selects the top-k neighbors with high rank similarity in order to predict a rating for an item that the target user has not yet experienced.

The most common traditional neighbor selection method for memory-based collaborative filtering is priority similarity.

In this paper, we analyze various problems with the traditional neighbor selection method and propose a novel method to improve upon them.

The proposed method minimizes the similarity evaluation errors with the existing neighbor selection method by considering the number of common items between two objects.

The method is effective for the practical application of collaborative filtering.

For validation, we analyze and compare experimental results between an existing method and the proposed method.

We were able to confirm that the proposed method can improve the prediction accuracy of memory-based collaborative filtering by neighbor selection that prioritizes the number of common items.