arXiv Machine Learning By Haris Aziz, Barton E. Lee, Sean Morota Chu, Jeremy Vollen

Proportionally Representative Clustering

Read the original on arXiv Machine Learning →

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.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

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.

By Zeyu Lin, Chaoqi Jia, Longkun Guo, Chao Chen
arXiv Machine Learning
Sep 10

A Sub-4 Approximation for Fair $k$-Means

arXiv:2609.07974v1 Announce Type: cross Abstract: Fairness in clustering has attracted sustained research interest, motivated by the need to ensure equitable representation of protected groups in mac...

By Kangke Cheng, Guanlin Mo, Shihong Song, Hu Ding