Locally differentially private item-based collaborative filtering

被引:32
作者
Guo, Taolin [1 ]
Luo, Junzhou [1 ]
Dong, Kai [1 ]
Yang, Ming [1 ]
机构
[1] Southeast Univ, Sch Comp Sci & Engn, Nanjing 211189, Jiangsu, Peoples R China
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
Local differential privacy; Collaborative filtering; Data reconstruction; MATRIX FACTORIZATION; RANDOMIZED-RESPONSE; RECOMMENDATION;
D O I
10.1016/j.ins.2019.06.021
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recently, item-based collaborative filtering has attracted a lot of attention. It recommends to users new items which may be of interests to them, based on their reported historical data (i.e., the items they have already been interested in). The reported historical data leads to significant privacy risks in case that the recommending service is not fully trusted. Many researches have focused on developing differential privacy mechanisms to protect personal data in various recommendations. However, most of these mechanisms can not ensure accuracy of the recommendations. The main reason for this problem is that these methods compute similarity directly from the perturbation data. The computed similarity is thus always inaccurate and this inaccurate similarity finally leads to inaccurate recommendation results. In this paper, we propose a locally differentially private item-based collaborative filtering framework, which protects users' private historical data on the user side, and on the server-side reconstructs the similarity to ensure recommendation accuracy. The similarities are reconstructed for every pair of items, by estimating the number of users who have rated neither, either one, or both of them. The final recommendation is generated by the reconstructed similarities. Experimental results show that our proposed method significantly outperforms the state-of-the-art methods in terms of the recommendation accuracy and the trade-off between privacy and accuracy. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:229 / 246
页数:18
相关论文
共 45 条
[1]   Local, Private, Efficient Protocols for Succinct Histograms [J].
Bassily, Raef ;
Smith, Adam .
STOC'15: PROCEEDINGS OF THE 2015 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2015, :127-135
[2]   Privacy-preserving distributed collaborative filtering [J].
Boutet, Antoine ;
Frey, Davide ;
Guerraoui, Rachid ;
Jegou, Arnaud ;
Kermarrec, Anne-Marie .
COMPUTING, 2016, 98 (08) :827-846
[3]   "You Might Also Like:" Privacy Risks of Collaborative Filtering [J].
Calandrino, Joseph A. ;
Kilzer, Ann ;
Narayanan, Arvind ;
Felten, Edward W. ;
Shmatikov, Vitaly .
2011 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2011), 2011, :231-246
[4]   ] Marginal Release Under Local Differential Privacy [J].
Cormode, Graham ;
Kulkarni, Tejas ;
Srivastava, Divesh .
SIGMOD'18: PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2018, :131-146
[5]   Item-based top-N recommendation algorithms [J].
Deshpande, M ;
Karypis, G .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2004, 22 (01) :143-177
[6]  
Diana G., 2013, Model Assist Stat Appl, V8, P19, DOI DOI 10.3233/MAS-2012-0233
[7]  
Ding Z, 2016, I COMP CONF WAVELET, P195, DOI 10.1109/ICCWAMTIP.2016.8079836
[8]  
Du W., 2003, P 9 ACM SIGKDD INT C, P505
[9]   Privacy Aware Learning [J].
Duchi, John C. ;
Jordan, Michael I. ;
Wainwright, Martin J. .
JOURNAL OF THE ACM, 2014, 61 (06) :1-57
[10]  
Dwork C, 2006, LECT NOTES COMPUT SC, V4052, P1