arXiv Machine Learning
A Sub-4 Approximation for Fair $k$-Means
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv AI
Sep 10
Parameterized and Streaming Algorithms for Euclidean Fair $k$-Center Clustering
The paper presents new algorithms for fair k‑center clustering in Euclidean spaces, where a dataset is divided into groups and each group has a limit on the number of centers that can be chosen. A parameterized approximation algorithm achieves a 2.732 ratio, which is improved to 2.414 with exponential time in k. By integrating this into a one‑pass streaming framework, the authors obtain streaming approximations of 4.464 (improvable to 3.828) and a polynomial‑time streaming algorithm with a 4.732 ratio, further reduced to 4.42, surpassing previous state‑of‑the‑art results. Experiments confirm that these methods outperform existing approaches in clustering accuracy.
arXiv Machine Learning
Jul 7
Proportionally Representative Clustering
arXiv:2304. 13917v4 Announce Type: replace Abstract: In recent years, there has been a surge in effort to formalize notions of fairness in machine learning.
arXiv AI
Jun 29
Unbiased Binning for Fairness-aware Attribute Representation
arXiv:2509. 21785v2 Announce Type: replace-cross Abstract: Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset.
arXiv Machine Learning
Sep 10
Beyond Worst-Case Coreset Bounds for $k$-Clustering via Determinantal Sampling
arXiv:2609.06394v1 Announce Type: cross Abstract: Massive datasets in modern machine learning have made data reduction a central challenge, particularly for clustering tasks where memory and computat...
arXiv Machine Learning
Jul 7
Sensitivity Sampling with Predictions for k-Means Clustering
arXiv:2607. 04949v1 Announce Type: new Abstract: We study the problem of k-means clustering on large datasets.
arXiv Machine Learning
Jun 9
Generalizing Fair Top-$k$ Selection: An Integrative Approach
arXiv:2603. 04689v3 Announce Type: replace-cross Abstract: Fair top-$k$ selection, which ensures appropriate proportional representation of members from minority or historically disadvantaged groups among the top-$k$ selected candidates, has drawn significant attention.