A Lightweight Matrix Factorization for Recommendation With Local Differential Privacy in Big Data

被引:21
作者
Zhou, Hao [1 ,2 ]
Yang, Geng [1 ,2 ]
Xiang, Yang [3 ]
Bai, Yunlu [1 ]
Wang, Weiya [1 ]
机构
[1] Nanjing Univ Posts & Telecommun, Coll Comp Sci & Software, Nanjing 210023, Jiangsu, Peoples R China
[2] Big Data Secur & Intelligent Proc Lab, Nanjing 210003, Peoples R China
[3] Swinburne Univ Technol, Hawthorn, Vic 3122, Australia
基金
中国国家自然科学基金;
关键词
Privacy; Machine learning; Security; Differential privacy; Data models; Servers; Computational modeling; Local differential privacy; big data; matrix factorization; recommendation; randomized response; internet of things;
D O I
10.1109/TBDATA.2021.3139125
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The proliferation of various items recommended by Internet-based systems has resulted in the exponential growth of the number of ratings in the big data era. Recent advances in matrix factorization have made it an effective way to process these ratings for recommendations. However, we confront a challenge in deploying a matrix factorization model for recommendations in big data that arises from the typically resource-constrained local devices regarding their storage space and computing capacity. This paper proposes a novel lightweight matrix factorization for recommendations. Our scheme deploys shard grandients training on user local internet of things(IoT) devices, which makes it possible for users to train big data model locally. We design a two-phase solution to protect the security of users' data and reduce the dimension of the items. Moreover, we optimize the proposed scheme by introducing a stabilization mechanism to decrease the scale of the perturbed gradients. Some experimental results are given with two real online datasets, MovieLens and LibimSeTi. The theoretical analysis and experimental results demonstrate that compared with other methods, the proposed scheme achieves a good performance in terms of security, accuracy, and efficiency.
引用
收藏
页码:160 / 173
页数:14
相关论文
共 36 条
[1]  
Balu R., 2016, P 4 ACM WORKSH INF H, P57, DOI DOI 10.1145/2909827.2930793
[2]   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
[3]  
Berlioz A., 2015, P 9 ACM C REC SYST, P107, DOI DOI 10.1145/2792838.2800173
[4]  
Brozovsky L, 2007, ARXIV
[5]   "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
[6]  
Chen R, 2016, PROC INT CONF DATA, P289, DOI 10.1109/ICDE.2016.7498248
[7]  
Dong DP, 2015, PROCEEDINGS 2015 IEEE INTERNATIONAL CONFERENCE ON BIG DATA, P1183, DOI 10.1109/BigData.2015.7363872
[8]   Local Privacy and Statistical Minimax Rates [J].
Duchi, John C. ;
Jordan, Michael I. ;
Wainwright, Martin J. .
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, :429-438
[9]   Calibrating noise to sensitivity in private data analysis [J].
Dwork, Cynthia ;
McSherry, Frank ;
Nissim, Kobbi ;
Smith, Adam .
THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 :265-284
[10]   RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal Response [J].
Erlingsson, Ulfar ;
Pihur, Vasyl ;
Korolova, Aleksandra .
CCS'14: PROCEEDINGS OF THE 21ST ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2014, :1054-1067