Research map / Learning theory and algorithms / Fairness
A Pairwise Fair and Community-preserving Approach to k-Center Clustering
Brian Brubach, Darshan Chakrabarti, John Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas
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 random exponential cluster expansion and reassignment | k-center clustering · pmed dataset, 40 instances | maximum pairwise separation ratio | Improved |
| Add random exponential cluster expansion and reassignment | k-center clustering · pmed dataset, 40 instances | maximum average number of clusters per community: less than two | Improved |
| Add random exponential cluster expansion and reassignment | k-center clustering · pmed dataset, 40 instances | maximum cluster radius | Hurt |
| Use \lambda = 1/R_{Scr} instead of \lambda = 4/R_{Scr} or \lambda = 16/R_{Scr} (ablation) | FairAlg · adult dataset, 1,000-point sample, k from 2 to 20 | pairwise fairness consistency across k | Improved |
| Use \lambda = 1/R_{Scr} rather than larger tested \lambda values (ablation) | FairAlg · adult dataset, 1,000-point sample, k from 2 to 20 | maximum cluster radius | Hurt |
| Use \lambda = 16/R_{Scr} rather than \lambda = 4/R_{Scr} or \lambda = 1/R_{Scr} (ablation) | FairAlg · pmed dataset, 40 instances | maximum cluster radius | Improved |
| Use \lambda = 1/R_{Scr} rather than \lambda = 4/R_{Scr} or \lambda = 16/R_{Scr} (ablation) | FairAlg · pmed dataset, 40 instances | pairwise fairness | Improved |
| Use \lambda = 1/R_{Scr} rather than \lambda = 4/R_{Scr} or \lambda = 16/R_{Scr} (ablation) | FairAlg · pmed dataset, 40 instances | community preservation | Improved |
Closest papers by meaning
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 2024 · similarity 0.91)
- Towards Fairer Centroids in K-means Clustering (AAAI 2024 · similarity 0.91)
- Relax and Merge: A Simple Yet Effective Framework for Solving Fair $k$-Means and $k$-sparse Wasserstein Barycenter Problems (ICLR 2025 · similarity 0.90)
- Fair Clustering via Alignment (ICML 2025 · similarity 0.90)
- The Fairness-Quality Tradeoff in Clustering (NeurIPS 2024 · similarity 0.89)
- Proportional Fairness in Clustering: A Social Choice Perspective (NeurIPS 2024 · 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.
