arXiv (All)
open access
A Sub-4 Approximation for Fair $k$-Means
Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in machine learning applications. We study fair $k$-means clustering in Euclidean space, where the proportion of each protected group in every cluster must l
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Parameterized and Streaming Algorithms for Euclidean Fair $k$-Center Clustering#973965
- Multiplicative Metric Fairness Under Composition#713423
- Improving Fairness with Ensemble Combination: Margin-Dependent Bounds#972839
- Missing the missing values: The ugly duckling of fairness in machine learning#383471
- Optimal Dimension-Free Sampling for Regularized Classification#222592
Record · ID 985378
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive