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: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...
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: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:2607. 04949v1 Announce Type: new Abstract: We study the problem of k-means clustering on large datasets.
arXiv:2509. 21785v2 Announce Type: replace-cross Abstract: Discretizing raw features into bucketized attribute representations is a popular step before sharing a dataset.
arXiv:2601. 06351v2 Announce Type: replace Abstract: Anticlustering is an NP-hard combinatorial optimization problem that consists of partitioning a set of objects into equal-sized groups called anticlusters such that the objects in the same anticluster are as dissimilar as possible and thereby representative of the entire set of objects.
arXiv:2502. 08397v3 Announce Type: replace-cross Abstract: Clustering is a fundamental technique in data analysis and machine learning, used to group similar data points together.
arXiv:2607. 19704v1 Announce Type: new Abstract: Scaling LLM-based applications to millions of users is bottlenecked by the inference cost and latency of modern foundation models.
arXiv:2607. 26202v1 Announce Type: cross Abstract: The $k$-means++ algorithm is a standard and widely used seeding method for $k$-means clustering, but for a fixed number $k$ of centers its worst-case expected approximation ratio is $\Theta(\log k)$.
arXiv:2606. 04777v1 Announce Type: new Abstract: Clustering is increasingly used to support high-impact decisions, yet standard objectives such as $k$-means can produce clusterings that treat demographic groups unequally.
arXiv:2407. 11217v4 Announce Type: replace-cross Abstract: Clustering problems such as $k$-means and $k$-median are staples of unsupervised learning, and many algorithmic techniques have been developed to tackle their numerous aspects.
The paper investigates hierarchical clustering under an individual fairness constraint that limits relative distortion within local k‑nearest neighborhoods. It formulates this as a feasibility problem over dominated ultrametrics, characterizes the minimal multiplicative slack needed, identifies a sharp local threshold, proves stability under bounded perturbations, establishes monotonicity in k, and demonstrates a Θ(log n) separation between local and global realizability. Experiments on synthetic and real‑world datasets corroborate the theoretical findings.