pith. sign in

arxiv: 1503.01647 · v1 · pith:XMN2TUHGnew · submitted 2015-03-05 · 💻 cs.IR

Decentralized Recommender Systems

classification 💻 cs.IR
keywords decentralizedalgorithmproposedrecommendersystemuseradvantagesalgorithms
0
0 comments X
read the original abstract

This paper proposes a decentralized recommender system by formulating the popular collaborative filleting (CF) model into a decentralized matrix completion form over a set of users. In such a way, data storages and computations are fully distributed. Each user could exchange limited information with its local neighborhood, and thus it avoids the centralized fusion. Advantages of the proposed system include a protection on user privacy, as well as better scalability and robustness. We compare our proposed algorithm with several state-of-the-art algorithms on the FlickerUserFavor dataset, and demonstrate that the decentralized algorithm can gain a competitive performance to others.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.