Database Paper Browser

Back to papers

F3 KM: Federated, Fair, and Fast k-means

Summary: Federated, fair, and fast k-means (F3 KM): decomposes fair clustering into client-local ADMM subproblems with only updates exchanged. Supports multiple or no sensitive attributes; linear-time computation and favorable communication trade-offs; scales to 5M points in ~1 hour. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6743
Venue
SIGMOD
Year
2023
Pagerank
4.1945683e-05
Overall Rank
11,219 | 21.96%
DOI
10.1145/3626728

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,317 Highly-Efficient Large-Scale k-means with Individual Fairness 2026 VLDB 4.1945683e-05
10,716 Federated and Balanced Clustering for High-dimensional Data 2025 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
270 OPTICS: Ordering Points To Identify the Clustering Structure 1999 SIGMOD 0.00029505642
313 Graph Clustering Based on Structural/Attribute Similarities 2009 VLDB 0.00028097557
1,516 k-Shape: Efficient and Accurate Clustering of Time Series 2015 SIGMOD 0.00011586255
1,597 Designing Fair Ranking Schemes 2019 SIGMOD 0.00011209846
2,163 Elastic Machine Learning Algorithms in Amazon SageMaker 2020 SIGMOD 9.3949234e-05
2,227 Blowfish Privacy: Tuning Privacy-Utility Trade-offs using Policies 2014 SIGMOD 9.2421238e-05
2,642 Vertica-ML: Distributed Machine Learning in Vertica Database 2020 SIGMOD 8.3851878e-05
3,412 On the Database/Network Interface in Large-Scale Publish/Subscribe Systems 2006 SIGMOD 7.1244283e-05
3,506 BlindFL: Vertical Federated Machine Learning without Peeking into Your Data 2022 SIGMOD 7.0291192e-05
3,628 OceanBase: A 707 Million tpmC Distributed Relational Database System 2022 VLDB 6.9031596e-05
4,652 On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection 2021 VLDB 6.0228549e-05
5,755 A Framework for Clustering Uncertain Data 2015 VLDB 5.3402052e-05
6,700 Differentially Private Vertical Federated Clustering 2023 VLDB 4.9563668e-05
7,046 Through the Data Management Lens: Experimental Analysis and Evaluation of Fair Classification 2022 SIGMOD 4.8525913e-05
11,193 Prerequisite-driven Fair Clustering on Heterogeneous Information Networks 2023 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
10,924 Improved Approximation Algorithms for Relational Clustering 2024 PODS 4.1945683e-05
13,151 Communication Efficient and Provable Federated Unlearning 2024 VLDB -
2,093 Scalable K-Means++ 2012 VLDB 9.5588104e-05
4,652 On the Efficiency of K-Means Clustering: Evaluation, Optimization, and Algorithm Selection 2021 VLDB 6.0228549e-05
11,193 Prerequisite-driven Fair Clustering on Heterogeneous Information Networks 2023 SIGMOD 4.1945683e-05
8,666 Contributions Estimation in Federated Learning: A Comprehensive Experimental Evaluation 2024 VLDB 4.471975e-05
6,700 Differentially Private Vertical Federated Clustering 2023 VLDB 4.9563668e-05
10,943 Efficient Algorithm for K-Multiple-Means 2024 SIGMOD 4.1945683e-05
10,716 Federated and Balanced Clustering for High-dimensional Data 2025 VLDB 4.1945683e-05
10,317 Highly-Efficient Large-Scale k-means with Individual Fairness 2026 VLDB 4.1945683e-05