Research map / Learning theory and algorithms / Clustering
Fair Clustering Under a Bounded Cost
Seyed A. Esmaeili, Brian Brubach, Aravind Srinivasan, John P Dickerson
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 |
|---|---|---|---|
| raise the clustering cost upper bound (price of fairness) (ablation) | Group-utilitarian algorithm · Adult and Census1990, delta=0.1 | group-utilitarian objective | Improved |
| use fewer clusters (lower k) (ablation) | Group-utilitarian algorithm · Adult and Census1990 | group-utilitarian objective at fixed cost bound | Improved |
| raise the allowed clustering cost for hard colors (ablation) | Group-egalitarian and leximin algorithms · Adult (race, delta=0.05, k=10) and Census1990 (age, delta=0.1, k=5) | per-group proportional violation | Improved |
Closest papers by meaning
- Fair Algorithms for Clustering (NeurIPS 2019 · similarity 0.92)
- Fair Clustering via Alignment (ICML 2025 · similarity 0.91)
- The Fairness-Quality Tradeoff in Clustering (NeurIPS 2024 · similarity 0.91)
- Towards Fairer Centroids in K-means Clustering (AAAI 2024 · similarity 0.89)
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 2024 · similarity 0.89)
- Accelerating Spectral Clustering under Fairness Constraints (ICML 2025 · similarity 0.89)
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.
