Research map / Learning theory and algorithms / Clustering
Fair, Polylog-Approximate Low-Cost Hierarchical Clustering
Marina Knittel, Max Springer, John P Dickerson, MohammadTaghi Hajiaghayi
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 |
|---|---|---|---|
| Replace the prior fair clustering procedure with MakeFair | average-linkage hierarchy · Census, n=128 | relative cost: 3.65240727 -> 1.08586718 | Improved |
| Replace the prior fair clustering procedure with MakeFair | average-linkage hierarchy · Census, n=256 | relative cost: 5.68329859 -> 1.42082465 | Improved |
| Replace the prior fair clustering procedure with MakeFair | average-linkage hierarchy · Census, n=512 | relative cost: 12.30571685 -> 2.5869583 | Improved |
| Replace the prior fair clustering procedure with MakeFair | average-linkage hierarchy · Census, n=1024 | relative cost: 25.17125835 -> 6.6745378 | Improved |
| Replace the prior fair clustering procedure with MakeFair | average-linkage hierarchy · Census, n=2048 | relative cost: 52.93911771 -> 7.86944693 | Improved |
| Tune ε to 1/(4 · log n) instead of 1/(8 · log₂ n) (ablation) | MakeFair · Census, n=512 | cluster balance | Improved |
| Tune ε to 1/(2 · log n) instead of 1/(4 · log n) (ablation) | MakeFair · Census, n=512 | cluster balance | Improved |
| Tune c from 8 to 4 (ablation) | MakeFair · Bank, n=512 | cluster balance | Improved |
| Tune c from 4 to 2 (ablation) | MakeFair · Bank, n=512 | cluster balance | Improved |
Closest papers by meaning
- Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost (ICML 2023 · similarity 0.95)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.87)
- Fair Clustering in the Sliding Window Model (ICLR 2025 · similarity 0.86)
- Relative Error Fair Clustering in the Weak-Strong Oracle Model (ICML 2025 · similarity 0.86)
- Fair Clustering via Alignment (ICML 2025 · similarity 0.86)
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 2024 · similarity 0.86)
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.
