A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Novel Neighbor Selection Method to Improve Data Sparsity Problem in Collaborative Filtering
2013
International Journal of Distributed Sensor Networks
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
doi:10.1155/2013/847965
fatcat:vbb7ehanrzbgbeucvoigxbkt24