FedPOIRec: Privacy Preserving Federated POI Recommendation with Social Influence

With the growing number of Location-Based Social Networks, privacy preserving location prediction has become a primary task for helping users discover new points-of-interest (POIs). Traditional systems consider a centralized approach that requires the transmission and collection of users’ private data. In this work, we present FedPOIRec, a privacy preserving federated learning approach enhanced with features from users’ social circles for top-N POI recommendations. First, the FedPOIRec framework is built on the principle that local data never leave the owner’s device, while the local updates are blindly aggregated by a parameter server. Second, the local recommenders get personalized by allowing users to exchange their learned parameters, enabling knowledge transfer among friends. To this end, we propose a privacy preserving protocol for integrating the preferences of a user’s friends after the federated computation, by exploiting the properties of the CKKS fully homomorphic encryption scheme. To evaluate FedPOIRec, we apply our approach into five real-world datasets using two recommendation models. Extensive experiments demonstrate that FedPOIRec achieves comparable recommendation quality to centralized approaches, while the social integration protocol incurs low computation and communication overhead on the user side.

[1]  George Karypis,et al.  A Comprehensive Survey of Neighborhood-based Recommendation Methods , 2011, Recommender Systems Handbook.

[2]  Michael R. Lyu,et al.  Fused Matrix Factorization with Geographical and Social Influence in Location-Based Social Networks , 2012, AAAI.

[3]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[4]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[5]  Bingzhe Wu,et al.  Practical Privacy Preserving POI Recommendation , 2020, ACM Trans. Intell. Syst. Technol..

[6]  Frederik Vercauteren,et al.  Fully homomorphic SIMD operations , 2012, Designs, Codes and Cryptography.

[7]  Jun Zhou,et al.  Privacy Preserving Point-of-Interest Recommendation Using Decentralized Matrix Factorization , 2018, AAAI.

[8]  Vitaly Shmatikov,et al.  Exploiting Unintended Feature Leakage in Collaborative Learning , 2018, 2019 IEEE Symposium on Security and Privacy (SP).

[9]  Philippe Cudré-Mauroux,et al.  Revisiting User Mobility and Social Relationships in LBSNs: A Hypergraph Embedding Approach , 2019, WWW.

[10]  Shiho Moriai,et al.  Privacy-Preserving Deep Learning via Additively Homomorphic Encryption , 2018, IEEE Transactions on Information Forensics and Security.

[11]  Yuan Zhang,et al.  PFLM: Privacy-preserving federated learning with membership proof , 2021, Inf. Sci..

[12]  Klaus-Robert Müller,et al.  Robust and Communication-Efficient Federated Learning From Non-i.i.d. Data , 2019, IEEE Transactions on Neural Networks and Learning Systems.

[13]  Tommaso Di Noia,et al.  How to put users in control of their data in federated top-N recommendation with learning to rank , 2021, SAC.

[14]  Jiawei Han,et al.  Bridging Collaborative Filtering and Semi-Supervised Learning: A Neural Approach for POI Recommendation , 2017, KDD.

[15]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[16]  Daniele Micciancio,et al.  On the Security of Homomorphic Encryption on Approximate Numbers , 2020, IACR Cryptol. ePrint Arch..

[17]  Craig Gentry,et al.  (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.

[18]  Kai Chen,et al.  Secure Federated Matrix Factorization , 2019, IEEE Intelligent Systems.

[19]  Gebräuchliche Fertigarzneimittel,et al.  V , 1893, Therapielexikon Neurologie.

[20]  Yang Guo,et al.  A survey of collaborative filtering based social recommender systems , 2014, Comput. Commun..

[21]  Natalia Gimelshein,et al.  PyTorch: An Imperative Style, High-Performance Deep Learning Library , 2019, NeurIPS.

[22]  Vinod Vaikuntanathan,et al.  Can homomorphic encryption be practical? , 2011, CCSW '11.

[23]  Gediminas Adomavicius,et al.  Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions , 2005, IEEE Transactions on Knowledge and Data Engineering.

[24]  Chris Peikert,et al.  On Ideal Lattices and Learning with Errors over Rings , 2010, JACM.

[25]  Hao Wang,et al.  Location recommendation in location-based social networks using user check-in data , 2013, SIGSPATIAL/GIS.

[26]  Tancrède Lepoint,et al.  Secure Single-Server Aggregation with (Poly)Logarithmic Overhead , 2020, IACR Cryptol. ePrint Arch..

[27]  Hubert Eichner,et al.  Towards Federated Learning at Scale: System Design , 2019, SysML.

[28]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[29]  Jung Hee Cheon,et al.  Homomorphic Encryption for Arithmetic of Approximate Numbers , 2017, ASIACRYPT.

[30]  Amir Houmansadr,et al.  Comprehensive Privacy Analysis of Deep Learning: Passive and Active White-box Inference Attacks against Centralized and Federated Learning , 2018, 2019 IEEE Symposium on Security and Privacy (SP).

[31]  Shai Halevi,et al.  Faster Homomorphic Linear Transformations in HElib , 2018, IACR Cryptol. ePrint Arch..

[32]  P. Alam ‘L’ , 2021, Composites Engineering: An A–Z Guide.

[33]  Nadia Magnenat-Thalmann,et al.  Time-aware point-of-interest recommendation , 2013, SIGIR.

[34]  Amit Sahai,et al.  Homomorphic Encryption Standard , 2019, IACR Cryptol. ePrint Arch..

[35]  Qiang Yang,et al.  One-Class Collaborative Filtering , 2008, 2008 Eighth IEEE International Conference on Data Mining.

[36]  Blaise Agüera y Arcas,et al.  Communication-Efficient Learning of Deep Networks from Decentralized Data , 2016, AISTATS.

[37]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[38]  Ke Wang,et al.  Personalized Top-N Sequential Recommendation via Convolutional Sequence Embedding , 2018, WSDM.

[39]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[40]  P. Alam ‘W’ , 2021, Composites Engineering.

[41]  Nick Roussopoulos,et al.  Nearest neighbor queries , 1995, SIGMOD '95.

[42]  Sashank J. Reddi,et al.  SCAFFOLD: Stochastic Controlled Averaging for Federated Learning , 2019, ICML.

[43]  A. Salman Avestimehr,et al.  Turbo-Aggregate: Breaking the Quadratic Aggregation Barrier in Secure Federated Learning , 2020, IEEE Journal on Selected Areas in Information Theory.

[44]  Miss A.O. Penney (b) , 1974, The New Yale Book of Quotations.

[45]  Jie Yang,et al.  LBSN2Vec++: Heterogeneous Hypergraph Embedding for Location-Based Social Networks , 2020, IEEE Transactions on Knowledge and Data Engineering.

[46]  Kuo-Yi Lin,et al.  A Survey on federated learning* , 2020, 2020 IEEE 16th International Conference on Control & Automation (ICCA).

[47]  Jimmy Ba,et al.  Adam: A Method for Stochastic Optimization , 2014, ICLR.

[48]  Tong Zhao,et al.  Leveraging Social Connections to Improve Personalized Ranking for Collaborative Filtering , 2014, CIKM.

[49]  Sarvar Patel,et al.  Practical Secure Aggregation for Privacy-Preserving Machine Learning , 2017, IACR Cryptol. ePrint Arch..

[50]  Vitaly Shmatikov,et al.  Robust De-anonymization of Large Sparse Datasets , 2008, 2008 IEEE Symposium on Security and Privacy (sp 2008).

[51]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[52]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.