Research map / Learning theory and algorithms / Clustering
Generalizing Fair Clustering to Multiple Groups: Algorithms and Applications
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Fair Algorithms for Clustering (NeurIPS 2019 · similarity 0.94)
- Towards Fairer Centroids in K-means Clustering (AAAI 2024 · similarity 0.92)
- Fair Clustering via Alignment (ICML 2025 · similarity 0.91)
- Proportional Fairness in Non-Centroid Clustering (NeurIPS 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.89)
- The Fairness-Quality Tradeoff in Clustering (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.