基于LSH的隐私保护POI推荐算法

doi:10.19678/j.issn.1000-3428.0049731

摘要/Abstract

摘要：

基于位置的社交网络利用用户的签到数据进行兴趣点(POI)推荐,但是出于对数据隐私的考虑,各种社交平台之间不愿意直接共享数据。为综合各个社交平台的数据从而提供更好的POI推荐服务,提出一种基于局部敏感哈希(LSH)的隐私保护POI推荐算法。通过LSH选取相似用户集合,极大地减少计算量,满足用户的快速响应需求。利用LSH和Paillier同态加密技术,在计算过程中保护数据隐私不被泄露。真实数据集上的实验结果表明,在响应时间和预测准确度上,该算法优于传统基于用户的协同过滤推荐算法。

关键词: 局部敏感哈希, 隐私保护, 推荐算法, 兴趣点, 同态加密

Abstract:

The Location-Based Social Network(LBSN) uses the user’s check-in data to recommend the Point of Interest (POI),but for the consideration of data privacy,various social platforms are unwilling to share data directly.In order to provide a better POI recommendation service by synthesizing the data of various social platforms,a privacy preserving POI recommendation algorithm based on Locality-Sensitive Hashing(LSH) is proposed.The similar user set is selected by LSH,which greatly reduces the computation cost and satisfies the user’s rapid response demand.LSH and Paillier homomorphic encryption techniques are used to protect data privacy from disclosure.Experimental results on real data sets show that the proposed algorithm is superior to the traditional collaborative filtering recommendation algorithm based on users in response time and prediction accuracy.

Key words: Locality-Sensitive Hashing(LSH), privacy preserving, recommendation algorithm, Point of Interest(POI), homomorphic encryption

中图分类号:

TP391.3

沈鑫娣,翟东君,张得天,刘安. 基于LSH的隐私保护POI推荐算法[J]. 计算机工程, 2019, 45(1): 96-102.

SHEN Xindi,ZHAI Dongjun,ZHANG Detian,LIU An. Privacy Preserving POI Recommendation Algorithm Based on LSH[J]. Computer Engineering, 2019, 45(1): 96-102.

http://www.ecice06.com/CN/Y2019/V45/I1/96

参考文献

［1］ADOMAVICIUS G,TUZHILIN A.Toward the next generation of recommender systems:a survey of the state-of-the-art and possible extensions［J］.IEEE Transactions on Knowledge and Data Engineering,2005,17(6):734-749.
［2］BAO J,ZHENG Y,WILKIE D,et al.Recommendations in location-based social networks:a survey［J］.GeoInformatica,2015,19(3):525-565.
［3］YU Y,CHEN X.A survey of point-of-interest recommendation in location-based social networks［C］//Proceedings of the 29th AAAI Conference on Artificial Intelligence.［S.l.］:AAAI Press,2015:130.
［4］冷亚军,陆青,梁昌勇.协同过滤推荐技术综述［J］.模式识别与人工智能,2014,27(8):720-734.
［5］BREESE J S,HECKERMAN D,KADIE C.Empirical analysis of predictive algorithms for collaborative filtering［C］//Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence.［S.l.］:Morgan Kaufmann Publishers Inc.,1998:43-52.
［6］GENTRY C.A fully homomorphic encryption scheme［M］.Stanford,USA :Stanford University,2009.
［7］ERKIN Z,VEUGEN T,TOFT T,et al.Generating private recommendations efficiently using homomorphic encryption and data packing［J］.IEEE Transactions on Information Forensics and Security,2012,7(3):1053-1066.
［8］LIU A,ZHENGY K,LIZ L,et al.Efficient secure similarity computation on encrypted trajectory data［C］//Proceedings of the 31st International Conference on Data Engineering.Washington D.C.,USA:IEEE Press,2015:66-77.
［9］CANNY J.Collaborative filtering with privacy［C］//Proceedings of 2002 IEEE Symposium on Security and Privacy.Washington D.C.,USA:IEEE Press,2002:45-57.
［10］LI L,LIU A,LI Q,et al.Privacy-preserving collaborative Web services QoS prediction via YAO’s garbled circuits and homomorphic encryption［J］.Journal of Web Engineering,2016,15(3):203-225.
［11］HUANG Y,EVANS D,KATZ J,et al.Faster secure two-party computation using garbled circuits［C］//Proceedings of the 20th USENIX Conference on Security.［S.l.］:USENIX Association,2011:35.
［12］NIKOLAENKO V,IOANNIDIS S,WEINSBERG U,et al.Privacy-preserving matrix factorization［C］//Proceedings of 2013 ACM SIGSAC Conference on Computer and Communications Security.New York,USA:ACM Press,2013:801-812.
［13］NIKOLAENKO V,WEINSBERG U,IOANNIDIS S,et al.Privacy-preserving ridge regression on hundreds of millions of records［C］//Proceedings of 2013 IEEE Symposium on Security and Privacy.Washington D.C.,USA:IEEE Press,2013:334-348.
［14］ERKIN Z,VEUGEN T,TOFT T,et al.Generating private recommendations efficiently using homomorphic encryption and data packing［J］.IEEE Transactions on Information Forensics and Security,2012,7(3):1053-1066.
［15］SWEENEY L.k-anonymity:a model for protecting privacy［J］.International Journal of Uncertainty,Fuzziness and Knowledge-based Systems,2002,10(5):557-570.
［16］LI N,LI T,VENKATASUBRAMANIAN S.t-closeness:privacy beyond k-anonymity and l-diversity［C］//Proceedings of 2007 IEEE International Conference on Data Engineering.Washington D.C.,USA:IEEE Press,2007:106-115.
［17］POLAT H,DU W.Privacy-preserving collaborative filtering using randomized perturbation techniques［C］//Proceedings of the 3rd IEEE International Conference on Data Mining.Washington D.C.,USA:IEEE Press,2003:625-628.
［18］ZHU J,HE P,ZHENG Z,et al.A privacy-preserving QoS prediction framework for Web service recom-mendation［C］//Proceedings of 2015 IEEE International Conference on Web Services.Washington D.C.,USA:IEEE Press,2015:241-248.
［19］ZHANG S,FORD J,MAKEDON F.Deriving private information from randomly perturbed ratings［C］//Proceedings of 2006 SIAM International Conference on Data Mining.［S.l.］:Society for Industrial and Applied Mathematics,2006:59-69.
［20］DWORK C.Differential privacy:a survey of results［C］//Proceedings of the 5th International Conference on Theory and Applications of Models of Computation.Berlin,Germany:Springer,2008:1-19.
［21］熊平,朱天清,王晓峰.差分隐私保护及其应用［J］.计算机学报,2014,37(1):101-122.
［22］MCSHERRY F,MIRONOV I.Differentially private recommender systems:building privacy into the net［C］//Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.New York,USA:ACM Press,2009:627-636.
［23］JORGENSEN Z,YU T.A privacy-preserving framework for personalized,social recommendations［C］// Proceedings of the 17th International Conference on Extending Database Technology.［S.l.］:EDBT.2014:571-582.
［24］GUERRAOUI R,KERMARREC A M,PATRA R,et al.D2P:distance-based differential privacy in recommenders［J］.Proceedings of the VLDB Endowment,2015,8(8):862-873.
［25］LIU X,LIU A,ZHANG X,et al.When differential privacy meets randomized perturbation:a hybrid approach for privacy-preserving recommender system［C］//Proceedings of International Conference on Database Systems for Advanced Applications.Berlin,Germany:Springer,2017:576-591.
［26］SHEN Y,JIN H.EpicRec:towards practical differentially private framework for personalized recommendation［C］//Proceedings of 2016 ACM SIGSAC Conference on Computer and Communications Security.New York,USA:ACM Press,2016:180-191.
［27］GIONIS A,INDYK P,MOTWANI R.Similarity search in high dimensions via hashing［C］//Proceedings of the 25th International Conference on Very Large Data Bases.［S.l.］:Morgan Kaufmann Publishers Inc.,1999:518-529.
［28］史世泽.局部敏感哈希算法的研究［D］.西安:西安电子科技大学,2013.
［29］陈志伟,杜敏,杨亚涛,等.基于RSA和Paillier的同态云计算方案［J］.计算机工程,2013,39(7):35-39.

[1]	邱天晨, 郑小盈, 祝永新, 封松林. 面向非独立同分布数据的联邦学习架构[J]. 计算机工程, 2023, 49(7): 110-117.
[2]	陈福安, 柳毅. 基于区块链的V2G无证书环签密隐私保护方案[J]. 计算机工程, 2023, 49(6): 34-41,52.
[3]	许凤, 杨兴耀, 于炯, 李梓杨, 李晨瑜, 张君. 小波卷积增强的对比学习推荐算法[J]. 计算机工程, 2023, 49(5): 105-111,121.
[4]	杨越佳, 华蓓, 钟志威, 高咪. 基于同态加密的隐私保护逻辑回归协同计算[J]. 计算机工程, 2023, 49(4): 23-31.
[5]	唐敏, 张宇浩, 邓国强. 一种高效的非交互式隐私保护逻辑回归模型[J]. 计算机工程, 2023, 49(4): 32-42,51.
[6]	王群, 李馥娟, 倪雪莉, 夏玲玲, 梁广俊. 区块链隐私保护机制研究[J]. 计算机工程, 2023, 49(4): 1-13.
[7]	张晓均, 刘庆, 郑爽, 王鑫, 薛婧婷, 王世雄. 支持隐私保护的可验证云端数据分享方案[J]. 计算机工程, 2023, 49(3): 49-57.
[8]	郑云涛, 叶家炜. 基于茫然传输协议的FATE联邦迁移学习方案[J]. 计算机工程, 2023, 49(2): 24-30.
[9]	李尤慧子, 俞海涛, 殷昱煜, 高洪皓. 基于超级账本的集群联邦优化模型[J]. 计算机工程, 2023, 49(1): 22-30.
[10]	徐上上, 孙福振, 王绍卿, 董家玮, 吴田慧. 基于图神经网络的异构信任推荐算法[J]. 计算机工程, 2022, 48(9): 89-95,104.
[11]	苗雨欣, 宋春花, 牛保宁, 康瑞雪. 双通道图协同过滤推荐算法[J]. 计算机工程, 2022, 48(8): 121-128.
[12]	周全兴, 李秋贤, 丁红发, 樊玫玫. 基于博弈论优化的高效联邦学习方案[J]. 计算机工程, 2022, 48(8): 144-151,159.
[13]	王燕, 范林, 赵妮妮. 利用门控网络构建用户动态兴趣的序列推荐模型[J]. 计算机工程, 2022, 48(8): 283-291.
[14]	陈乃月, 金一, 李浥东, 蔡露鑫, 魏圆梦. 基于区块链的公平性联邦学习模型[J]. 计算机工程, 2022, 48(6): 33-41.
[15]	胡承佐, 王庆梅, 李迪超, 王铮. 基于复杂结构信息的图神经网络序列推荐算法[J]. 计算机工程, 2022, 48(5): 82-90,97.

选择文件类型/文献管理软件名称

选择包含的内容