Research map / Learning theory and algorithms / Clustering
A General Anchor-Based Framework for Scalable Fair Clustering
Shengfei Wei, Suyuan Liu, Jun Wang, Ke Liang, Miaomiao Li, Lei Luo
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| embed SpFC in the AFCF anchor framework | SpFC · Law School | NMI: 0.005 to 0.074 | Improved |
| embed VFC in the AFCF anchor framework | VFC · Bank | NMI: 0.044 to 0.062 | Improved |
| embed VFC in the AFCF anchor framework | VFC · Law School | NMI: 0.063 to 0.065 | Improved |
| embed VFC in the AFCF anchor framework | VFC · Census II | Balance: 0.678 -> 0.580 | Hurt |
| embed SpFC in the AFCF anchor framework | SpFC · Law School | ACC: 0.852 -> 0.703 | Hurt |
| embed VFC in the AFCF anchor framework | VFC · Census II | execution time (s): 1494.382 -> 918.220 | Improved |
| embed SpFC in the AFCF anchor framework | SpFC · Law School | execution time (s): 79.367 -> 8.907 | Improved |
| embed FFC in the AFCF anchor framework | FFC · Law School | execution time (s): 393.130 -> 11.139 | Improved |
| embed FMSC in the AFCF anchor framework | FMSC · Law School | execution time (s): 179.795 -> 13.206 | Improved |
| add FDAS fair anchor selection instead of random anchors (ablation) | SpFC-AF · Law School | NMI: 0.000 -> 0.074 | Improved |
| add FDAS fair anchor selection instead of DAS anchors (ablation) | SpFC-AF · Census II | Balance: 0.101 -> 0.906 | Improved |
| add FDAS fair anchor selection instead of random anchors (ablation) | SpFC-AF · Census II | Balance: 0.662 -> 0.906 | Improved |
Closest papers by meaning
- Fair Clustering via Alignment (ICML 2025 · similarity 0.90)
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 2024 · similarity 0.89)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.88)
- Towards Fairer Centroids in K-means Clustering (AAAI 2024 · similarity 0.87)
- Fair Clustering in the Sliding Window Model (ICLR 2025 · similarity 0.87)
- The Fairness-Quality Tradeoff in Clustering (NeurIPS 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
