Collaborative filtering using random neighbours in peer-to-peer networks

Traditionally, collaborative filtering (CF) algorithms used for recommendation operate on complete knowledge. This makes these algorithms hard to employ in a decentralized context where not all users’ ratings can be available at all locations. In this paper we investigate how the well-known neighbourhood-based CF algorithm by Herlocker et al. [5] operates on partial knowledge; that is, how many similar users does the algorithm actually need to produce good recommendations for a given user, and how similar must those users be. We show for the popular MovieLens 1,000,000 and Jester datasets that sufficiently good recommendations can be made based on the ratings of a neighbourhood consisting of a relatively small number of randomly selected users. Categories and Subject Descriptors H.3.4 [Information Storage and Retrieval]: Systems and Software—Performance evaluation (efficiency and effectiveness); H.3.4 [Information Storage and Retrieval]: Systems and Software—Distributed systems...

• Type: Conference
• Year: 2009
• Where: CIKM
• Authors: Arno Bakker, Elth Ogston, Maarten van Steen
• Keywords: Algorithm, CIKM 2009, Database, Information Storage, Neighbourhood-based Cf Algorithm