Addressing Sparsity in Decentralized Recommender Systems through Random Walks

Abstract : The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating recommender systems into existing P2P applications. On the other hand, the accuracy of recommender systems is often hurt by data sparsity. In this paper, we compare different decentralized user-based and item-based Collaborative Filtering (CF) algorithms with each other, and propose a new user-based random walk approach customized for decentralized systems, specically designed to handle sparse data. We show how the application of random walks to decentralized environments is different from the centralized version. We examine the performance of our random walk approach in different settings by varying the sparsity, the similarity measure and the neighborhood size. In addition, we introduce the popularizing disadvantage of the signicance weighting term traditionally used to increase the precision of similarity measures, and elaborate how it can affect the performance of the random walk algorithm. The simulations on MovieLens 10,000,000 ratings dataset demonstrate that over a wide range of sparsity, our algorithm outperforms other decentralized CF schemes. Moreover, our results show decentralized user-based approaches perform better than their item-based counterparts in P2P recommender applications.
Type de document :
[Research Report] 2010, pp.21
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger
Contributeur : Afshin Moin <>
Soumis le : jeudi 22 juillet 2010 - 20:03:58
Dernière modification le : vendredi 16 novembre 2018 - 01:40:21
Document(s) archivé(s) le : mardi 23 octobre 2012 - 11:00:44


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00505180, version 1


Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, Christopher Thraves-Caro. Addressing Sparsity in Decentralized Recommender Systems through Random Walks. [Research Report] 2010, pp.21. 〈inria-00505180〉



Consultations de la notice


Téléchargements de fichiers