Secure Social Recommendation based on Secret Sharing

• URL: http://arxiv.org/abs/2002.02088v2
• Date: Thu, 5 Mar 2020 06:43:35 GMT
• Title: Secure Social Recommendation based on Secret Sharing
• Authors: Chaochao Chen, Liang Li, Bingzhe Wu, Cheng Hong, Li Wang, Jun Zhou
• Abstract summary: Social information, which is rich on social platforms such as Facebook, are useful to recommender systems. Most existing recommendation models are built based on the assumptions that the social information are available. We propose a SEcure SOcial RECommendation framework which can collaboratively mine knowledge from social platform to improve the recommendation performance.
• Score: 23.74692198296859
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nowadays, privacy preserving machine learning has been drawing much attention in both industry and academy. Meanwhile, recommender systems have been extensively adopted by many commercial platforms (e.g. Amazon) and they are mainly built based on user-item interactions. Besides, social platforms (e.g. Facebook) have rich resources of user social information. It is well known that social information, which is rich on social platforms such as Facebook, are useful to recommender systems. It is anticipated to combine the social information with the user-item ratings to improve the overall recommendation performance. Most existing recommendation models are built based on the assumptions that the social information are available. However, different platforms are usually reluctant to (or cannot) share their data due to certain concerns. In this paper, we first propose a SEcure SOcial RECommendation (SeSoRec) framework which can (1) collaboratively mine knowledge from social platform to improve the recommendation performance of the rating platform, and (2) securely keep the raw data of both platforms. We then propose a Secret Sharing based Matrix Multiplication (SSMM) protocol to optimize SeSoRec and prove its correctness and security theoretically. By applying minibatch gradient descent, SeSoRec has linear time complexities in terms of both computation and communication. The comprehensive experimental results on three real-world datasets demonstrate the effectiveness of our proposed SeSoRec and SSMM.

Related papers

• P4GCN: Vertical Federated Social Recommendation with Privacy-Preserving Two-Party Graph Convolution Networks [17.901647467076476]
  We propose a novel vertical social recommendation method leveraging privacy-preserving two-party graph convolution networks (P4GCN) Experiments on four real-world datasets demonstrate that P4GCN outperforms state-of-the-art methods in terms of recommendation accuracy.
  arXiv  Detail & Related papers  (2024-10-16T12:29:22Z)
• System-2 Recommenders: Disentangling Utility and Engagement in Recommendation Systems via Temporal Point-Processes [80.97898201876592]
  We propose a generative model in which past content interactions impact the arrival rates of users based on a self-exciting Hawkes process. We show analytically that given samples it is possible to disentangle System-1 and System-2 and allow content optimization based on user utility.
  arXiv  Detail & Related papers  (2024-05-29T18:19:37Z)
• Balancing User Preferences by Social Networks: A Condition-Guided Social Recommendation Model for Mitigating Popularity Bias [64.73474454254105]
  Social recommendation models weave social interactions into their design to provide uniquely personalized recommendation results for users. Existing social recommendation models fail to address the issues of popularity bias and the redundancy of social information. We propose a Condition-Guided Social Recommendation Model (named CGSoRec) to mitigate the model's popularity bias.
  arXiv  Detail & Related papers  (2024-05-27T02:45:01Z)
• Learning Social Graph for Inactive User Recommendation [50.090904659803854]
  LSIR learns an optimal social graph structure for social recommendation, especially for inactive users. Experiments on real-world datasets demonstrate that LSIR achieves significant improvements of up to 129.58% on NDCG in inactive user recommendation.
  arXiv  Detail & Related papers  (2024-05-08T03:40:36Z)
• FedGRec: Federated Graph Recommender System with Lazy Update of Latent Embeddings [108.77460689459247]
  We propose a Federated Graph Recommender System (FedGRec) to mitigate privacy concerns. In our system, users and the server explicitly store latent embeddings for users and items, where the latent embeddings summarize different orders of indirect user-item interactions. We perform extensive empirical evaluations to verify the efficacy of using latent embeddings as a proxy of missing interaction graph.
  arXiv  Detail & Related papers  (2022-10-25T01:08:20Z)
• Exploiting Data Sparsity in Secure Cross-Platform Social Recommendation [34.60672247558132]
  Social recommendation has shown promising improvements over traditional systems. Most existing work assumes that all data are available to the recommendation platform. We propose S3Rec, a sparsity-aware secure cross-platform social recommendation framework.
  arXiv  Detail & Related papers  (2022-02-15T08:46:34Z)
• Federated Social Recommendation with Graph Neural Network [69.36135187771929]
  We propose fusing social information with user-item interactions to alleviate it, which is the social recommendation problem. We devise a novel framework textbfFedrated textbfSocial recommendation with textbfGraph neural network (FeSoG)
  arXiv  Detail & Related papers  (2021-11-21T09:41:39Z)
• Dual Side Deep Context-aware Modulation for Social Recommendation [50.59008227281762]
  We propose a novel graph neural network to model the social relation and collaborative relation. On top of high-order relations, a dual side deep context-aware modulation is introduced to capture the friends' information and item attraction.
  arXiv  Detail & Related papers  (2021-03-16T11:08:30Z)
• SocialTrans: A Deep Sequential Model with Social Information for Web-Scale Recommendation Systems [29.24459965940855]
  We present a novel deep learning model SocialTrans for social recommendations. The first module is based on a multi-layer Transformer to model users' personal preference. The second module is a multi-layer graph attention neural network (GAT), which is used to model the social influence strengths between friends in social networks. The last module merges users' personal preference and socially influenced preference to produce recommendations.
  arXiv  Detail & Related papers  (2020-05-09T03:39:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.