Privacy Enhanced Matrix Factorization for Recommendation with Local Differential Privacy

被引:162
作者
Shin, Hyejin [1 ]
Kim, Sungwook [1 ]
Shin, Junbum [1 ]
Xiao, Xiaokui [2 ]
机构
[1] Samsung Res, Seoul 06765, South Korea
[2] Natl Univ Singapore, Sch Comp, Singapore 119077, Singapore
关键词
Local differential privacy; matrix factorization; recommender system; random projection;
D O I
10.1109/TKDE.2018.2805356
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:1770 / 1782
页数:13
相关论文
共 29 条
  • [1] [Anonymous], 2016, PROCEEDINGS ON PRIVA
  • [2] [Anonymous], 1984, C MODERN ANAL PROBAB
  • [3] [Anonymous], 2012, ARTIF INTELL
  • [4] [Anonymous], 2007, Znalosti
  • [5] [Anonymous], ARXIV160605053 CS DB
  • [6] Balu R., 2016, P 4 ACM WORKSH INF H, P57, DOI DOI 10.1145/2909827.2930793
  • [7] Local, Private, Efficient Protocols for Succinct Histograms
    Bassily, Raef
    Smith, Adam
    [J]. STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, : 127 - 135
  • [8] Berlioz A., 2015, P 9 ACM C REC SYST R, P107, DOI DOI 10.1145/2792838.2800173
  • [9] "You Might Also Like:" Privacy Risks of Collaborative Filtering
    Calandrino, Joseph A.
    Kilzer, Ann
    Narayanan, Arvind
    Felten, Edward W.
    Shmatikov, Vitaly
    [J]. 2011 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2011), 2011, : 231 - 246
  • [10] Chen R, 2016, PROC INT CONF DATA, P289, DOI 10.1109/ICDE.2016.7498248