Research map / Learning theory and algorithms / Clustering
Probabilistic Fair Clustering
Seyed Esmaeili, Brian Brubach, Leonidas Tsepenekas, John 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 |
|---|---|---|---|
| Use the proposed fair clustering algorithm instead of color-blind clustering | k-means style clustering · Bank (two colors) | maximum additive violation: 25 -> 1 | Improved |
| Enforce fairness via the proposed algorithm | clustering · Bank (two colors) | POF: POF <= 1.02 | Hurt |
| Enforce fairness via the proposed algorithm on Adult vs CreditCard | metric membership · Adult, CreditCard | POF: 5% vs 25% | Mixed |
| Increase the number of clusters | metric membership fair clustering · Adult, CreditCard | POF | Hurt |
| Use the proposed algorithm instead of color-blind clustering | metric membership · Adult, CreditCard | normalized max additive violation: 250 -> 1 | Improved |
| Increase the cluster size lower bound | large cluster independent sampling algorithm · Census1990, k=5 | normalized violation: below 20% | Improved |
| Use the large cluster algorithm with probabilistic multi-color assignments | Census1990 · Census1990, k=5 | POF: less than 50% | Hurt |
Closest papers by meaning
- Fair Clustering Under a Bounded Cost (NeurIPS 2021 · similarity 0.91)
- Fair Clustering via Alignment (ICML 2025 · similarity 0.88)
- Towards Fairer Centroids in K-means Clustering (AAAI 2024 · similarity 0.88)
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 2024 · similarity 0.88)
- Parameterized Approximation Schemes for Fair-Range Clustering (NeurIPS 2024 · similarity 0.87)
- Accelerating Spectral Clustering under Fairness Constraints (ICML 2025 · 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.
