PEPPER
Authors:
Open Access
- 6 September 2022
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies
- Vol. 6 (3) , 1-27
Abstract
Recommender systems are proving to be an invaluable tool for extracting user-relevant content helping users in their daily activities (e.g., finding relevant places to visit, content to consume, items to purchase). However, to be effective, these systems need to collect and analyze large volumes of personal data (e.g., location check-ins, movie ratings, click rates .. etc.), which exposes users to numerous privacy threats. In this context, recommender systems based on Federated Learning (FL) appear to be a promising solution for enforcing privacy as they compute accurate recommendations while keeping personal data on the users' devices. However, FL, and therefore FL-based recommender systems, rely on a central server that can experience scalability issues besides being vulnerable to attacks. To remedy this, we propose PEPPER, a decentralized recommender system based on gossip learning principles. In PEPPER, users gossip model updates and aggregate them asynchronously. At the heart of PEPPER reside two key components: a personalized peer-sampling protocol that keeps in the neighborhood of each node, a proportion of nodes that have similar interests to the former and a simple yet effective model aggregation function that builds a model that is better suited to each user. Through experiments on three real datasets implementing two use cases: a location check-in recommendation and a movie recommendation, we demonstrate that our solution converges up to 42% faster than with other decentralized solutions providing up to 9% improvement on average performance metric such as hit ratio and up to 21% improvement on long tail performance compared to decentralized competitors.Keywords
All Related Versions
This publication has 29 references indexed in Scilit:
- I Know Nothing about You But Here is What You Might Like2017
- Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption2016
- A Scalable Implementation of Fully Homomorphic Encryption Built on NTRU2014
- A peer-to-peer recommender system for self-emerging user communities based on gossip overlaysJournal of Computer and System Sciences, 2013
- A Peer-to-Peer Recommender System with Privacy Constraints2009
- Heterogeneous Gossip2009
- Factorization meets the neighborhood2008
- On the accuracy of omnet++ in the wireless sensornetworks domain: simulation vs. testbed2007
- A scalable P2P recommender system based on distributed collaborative filteringExpert Systems with Applications, 2004
- The Diameter of a Scale-Free Random GraphCombinatorica, 2004