TY - JOUR
T1 - Privacy-Preserving Multi-Label Propagation Based on Federated Learning
AU - Guo, Kun
AU - Chen, Dangrun
AU - Huang, Qingqing
AU - Li, Fuan
AU - Guo, Chen
AU - Wu, Duanji
AU - Liu, Ximeng
AU - Chen, Kai
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - Multi-label propagation algorithms (MLPAs) aim to find vertex communities in a complex network or a cloud system by propagating and updating vertex labels, which have been widely applied in customer recommendation, protein molecule discovery, and criminal tracking. As more and more people are concerned about the leakage of their sensitive information, detecting communities without disclosing personal privacy has become a hot topic in complex network analysis. The existing anonymization-based community detection methods have to modify the network structure to protect the sensitive vertices or links, which complicates the recognition of true communities and incurs substantial accuracy loss. In this article, we first propose a federated graph learning model (FGLM) for distributed privacy-preserving network data mining. Second, a federated MLPA for distributed and attributed networks is implemented by adapting a standalone MLPA to FGLM to verify the model's effectiveness. We develop a label perturbation strategy to conceal vertex degrees in distributed label updating and employ a homomorphic encryption system to protect label weights exchanged between the participants. The experiments on real-world and synthetic datasets demonstrate that the new algorithm achieves zero accuracy loss and more than 200% higher accuracy than the simple distributed MLPA without federated learning.
AB - Multi-label propagation algorithms (MLPAs) aim to find vertex communities in a complex network or a cloud system by propagating and updating vertex labels, which have been widely applied in customer recommendation, protein molecule discovery, and criminal tracking. As more and more people are concerned about the leakage of their sensitive information, detecting communities without disclosing personal privacy has become a hot topic in complex network analysis. The existing anonymization-based community detection methods have to modify the network structure to protect the sensitive vertices or links, which complicates the recognition of true communities and incurs substantial accuracy loss. In this article, we first propose a federated graph learning model (FGLM) for distributed privacy-preserving network data mining. Second, a federated MLPA for distributed and attributed networks is implemented by adapting a standalone MLPA to FGLM to verify the model's effectiveness. We develop a label perturbation strategy to conceal vertex degrees in distributed label updating and employ a homomorphic encryption system to protect label weights exchanged between the participants. The experiments on real-world and synthetic datasets demonstrate that the new algorithm achieves zero accuracy loss and more than 200% higher accuracy than the simple distributed MLPA without federated learning.
KW - Community detection
KW - Federated learning
KW - Graph learning
KW - Multi-label propagation
KW - Privacy-preserving data mining
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:001139144400013
UR - https://openalex.org/W4386321897
UR - https://www.scopus.com/pages/publications/85169685061
U2 - 10.1109/TNSE.2023.3309988
DO - 10.1109/TNSE.2023.3309988
M3 - Journal Article
SN - 2327-4697
VL - 11
SP - 886
EP - 899
JO - IEEE Transactions on Network Science and Engineering
JF - IEEE Transactions on Network Science and Engineering
IS - 1
ER -