Privacy Enhanced Matrix Factorization for Recommendation with Local Differential Privacy

• Published in: IEEE transactions on knowledge and data engineering Vol. 30; no. 9; pp. 1770 - 1782
• Main Authors: Shin, Hyejin, Kim, Sungwook, Shin, Junbum, Xiao, Xiaokui
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2018; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Data privacy; Dimensionality reduction; Factorization; Iterative methods; Local differential privacy; matrix factorization; Motion pictures; Perturbation methods; Privacy; random projection; Ratings; recommender system; Recommender systems; Servers; User satisfaction
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2018.2805356

Recommender systems are collecting and analyzing user data to provide better user experience. However, several privacy concerns have been raised when a recommender knows user's set of items or their ratings. A number of solutions have been suggested to improve privacy of legacy recommender systems, but the existing solutions in the literature can protect either items or ratings only. In this paper, we propose a recommender system that protects both user's items and ratings. For this, we develop novel matrix factorization algorithms under local differential privacy (LDP). In a recommender system with LDP, individual users randomize their data themselves to satisfy differential privacy and send the perturbed data to the recommender. Then, the recommender computes aggregates of the perturbed data. This framework ensures that both user's items and ratings remain private from the recommender. However, applying LDP to matrix factorization typically raises utility issues with i) high dimensionality due to a large number of items and ii) iterative estimation algorithms. To tackle these technical challenges, we adopt dimensionality reduction technique and a novel binary mechanism based on sampling. We additionally introduce a factor that stabilizes the perturbed gradients. With MovieLens and LibimSeTi datasets, we evaluate recommendation accuracy of our recommender system and demonstrate that our algorithm performs better than the existing differentially private gradient descent algorithm for matrix factorization under stronger privacy requirements.