Federated Learning-Based Social Recommendation with Social Denoising

In social recommendation (SR), users' social connections and behavioral data often contain sensitive information, which might lead to a deep concern about privacy leakage. In the case where raw data is absent, federated learnings social recommendation (FLSR) provide an effective framework that can not only preserve a reliable performance but also ensure the security of privacy data through collaboratively training a global model. However, existing results on FLSR often directly employ the raw interaction data without considering the impact of noise or unreliable links in social network, which may significantly decrease the effectiveness of recommendation algorithms. To address such an issue, we propose a federated learning-based social de noising recommendation (FLSDR) method consisting of three modules: graph de noising, heterogeneous graph en-coder and privacy protector. Specifically, the graph de noising module incorporates a user preference consistency function and a deletion rate to remove low-quality social connections, achieving the goal of denoising. The heterogeneous graph encoder module ensures that user embed dings are updated locally, assigning different weights to different neighbors. The privacy protection module is designed to further safeguard privacy and prevent gradient leakage of user information. Experiments over two data sets shows that our model has achieved a 4.18% improvement in performance. Ablation studies demonstrate the necessities of each component.

Authors

Institutions

Publication Details

Published
2024-10-18
DOI
https://doi.org/10.1109/ntci64025.2024.10776360
Primary Topic
Recommender Systems and Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Federated Learning-Based Social Recommendation with Social Denoising

Zhihui Xu, Wenming Cao, Bing Li
Recommender Systems and Techniques
article

Federated Learning-Based Social Recommendation with Social Denoising

Zhihui Xu, Wenming Cao, Bing Li
article en

Abstract

In social recommendation (SR), users' social connections and behavioral data often contain sensitive information, which might lead to a deep concern about privacy leakage. In the case where raw data is absent, federated learnings social recommendation (FLSR) provide an effective framework that can not only preserve a reliable performance but also ensure the security of privacy data through collaboratively training a global model. However, existing results on FLSR often directly employ the raw interaction data without considering the impact of noise or unreliable links in social network, which may significantly decrease the effectiveness of recommendation algorithms. To address such an issue, we propose a federated learning-based social de noising recommendation (FLSDR) method consisting of three modules: graph de noising, heterogeneous graph en-coder and privacy protector. Specifically, the graph de noising module incorporates a user preference consistency function and a deletion rate to remove low-quality social connections, achieving the goal of denoising. The heterogeneous graph encoder module ensures that user embed dings are updated locally, assigning different weights to different neighbors. The privacy protection module is designed to further safeguard privacy and prevent gradient leakage of user information. Experiments over two data sets shows that our model has achieved a 4.18% improvement in performance. Ablation studies demonstrate the necessities of each component.

Chongqing Jiaotong University (CN)
Reduced inequalities
Openalex Percentile: Top 64%
Recommender Systems and Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.