Research map / Learning theory and algorithms / Fairness
Doubly Constrained Fair Clustering
John P Dickerson, Seyed A. Esmaeili, Jamie Heather Morgenstern, Claire Jie Zhang
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 |
|---|---|---|---|
| Add DS by post-processing a GF solution | GF clustering · GF+DS k-center | clustering cost: R\leq 2\barf | Hurt |
| Add GF by post-processing a DS solution | DS clustering · GF+DS k-center | clustering cost: 2(1+\alpha_{\textbf{DS}}) | Mixed |
| Require both GF and DS | Color-Blind k-center · Adult | price of fairness | Hurt |
| Use DS without adding GF | ALG-DS · Adult | GF violation: more than 5 times | Hurt |
| Add GF and DS constraints together | GFtoGFDS and DStoGFDS · Adult | DS violation: zero | Improved |
| Add GF and DS constraints together | GFtoGFDS and DStoGFDS · Adult | price of fairness | Mixed |
Closest papers by meaning
- Accelerating Spectral Clustering under Fairness Constraints (ICML 2025 · similarity 0.90)
- Towards Fairer Centroids in K-means Clustering (AAAI 2024 · similarity 0.89)
- Fair Clustering via Alignment (ICML 2025 · similarity 0.89)
- The Fairness-Quality Tradeoff in 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)
- Parameterized Approximation Schemes for Fair-Range Clustering (NeurIPS 2024 · similarity 0.88)
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.
