Fed-BRDECS: Privacy-Preserving and Heterogeneity-Aware Federated Deep Embedded Clustering
Not on the map. Why?
Abstract (arXiv)
Federated deep clustering seeks to learn clustering-friendly representations from decentralized unlabeled data while preserving client privacy. However, Deep Embedded Clustering (DEC)-style objectives depend on global soft-assignment statistics that require clients to reveal their sensitive information. We propose Fed-BRDECS, a privacy-preserving and heterogeneity-aware federated deep embedded clustering framework. Fed-BRDECS replaces the globally normalized clustering objective with a locally computable sample-stability loss, avoiding the transmission of local soft-assignment distributions. To tackle non-IID client distributions, we introduce prediction-balanced sampling, which oversamples locally rare predicted clusters without requiring ground-truth labels, and centroid-level restarting, which periodically refreshes biased or inactive centroids. Experiments on image and text clustering benchmarks show that Fed-BRDECS consistently outperforms representative federated clustering and deep clustering baselines under both IID and non-IID partitions. We further demonstrate its applicability to federated time-series anomaly detection, where it improves reconstruction-based detectors without adding inference-time cost.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 46 references that are in the map. First posted on arXiv 5 Oct 2026.
Builds on
7 of 46 references.
References · 7
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
- 2018Deep Learning for Classical Japanese Literaturecited by 422
- 2018Deep Temporal Clustering : Fully Unsupervised Learning of Time-Domain Featurescited by 37
- 2022Towards Federated Clustering: A Federated Fuzzy c-Means Algorithm (FFCM)cited by 30
- 2024CCFC: Bridging Federated Clustering and Contrastive Learningcited by 4
- 2023Dynamically Weighted Federated k-Meanscited by 2
Built on by
Not cited yet.