FedDPC: A Density Peak Clustering-based Federated Learning Algorithm

Federated learning (FL) is widely applied in edge computing scenarios to protect data privacy, but the assumption of independent and identically distributed (IID) data across clients often does not hold in practice, leading to performance degradation. Among the many methods proposed to address data heterogeneity, clustered federated learning (CFL) has emerged as a popular approach. Current CFL methods commonly adopt the expectation-maximization (EM) algorithm, which mitigates the problem of data heterogeneity. However, they still face challenges such as requiring more clients than traditional federated learning and introducing randomness in the clustering process. To overcome these limitations, we propose FedDPC, which integrates the density peak clustering (DPC) algorithm. This approach provides the advantages of not requiring additional clients and having a non-random partitioning strategy. Finally, we conducted experiments to demonstrate the feasibility and effectiveness of our proposed method.

Authors

Institutions

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1109/icairc64177.2024.10899937
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

FedDPC: A Density Peak Clustering-based Federated Learning Algorithm

Jiayi Du, Xucheng Li, Taiyin Zhao
Privacy-Preserving Technologies in Data
article

FedDPC: A Density Peak Clustering-based Federated Learning Algorithm

Jiayi Du, Xucheng Li, Taiyin Zhao
article en

Abstract

Federated learning (FL) is widely applied in edge computing scenarios to protect data privacy, but the assumption of independent and identically distributed (IID) data across clients often does not hold in practice, leading to performance degradation. Among the many methods proposed to address data heterogeneity, clustered federated learning (CFL) has emerged as a popular approach. Current CFL methods commonly adopt the expectation-maximization (EM) algorithm, which mitigates the problem of data heterogeneity. However, they still face challenges such as requiring more clients than traditional federated learning and introducing randomness in the clustering process. To overcome these limitations, we propose FedDPC, which integrates the density peak clustering (DPC) algorithm. This approach provides the advantages of not requiring additional clients and having a non-random partitioning strategy. Finally, we conducted experiments to demonstrate the feasibility and effectiveness of our proposed method.

University of Electronic Science and Technology of China (CN)
Openalex Percentile: Top 75%
Privacy-Preserving Technologies in Data
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.