← Back to all news
arXiv Machine Learning By Binita Maity, Shrutimoy Das

Individual Fairness in Hierarchical Clustering

Read the original on arXiv Machine Learning →

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.

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.

Related stories

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
safety
More like this →
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
benchmarkssafety
More like this →
arXiv Machine Learning
5d ago

Individual Fairness via Local Predictive Consistency

The paper introduces a node‑level relaxation of individual fairness called local predictive consistency, where each prediction is compared to a similarity‑weighted average of predictions in its local neighborhood. This approach yields an interpretable fairness score and a regularized learning method based on local residuals, and it explicitly constructs the neighborhood graph with threshold selection guided by graph‑coverage diagnostics. The authors apply the method to binary classification, regression, and time‑to‑event prediction, and compare it with pairwise constraint‑based fairness formulations to analyze fairness‑performance trade‑offs.

By Zhouting Zhao, Tin Lok James Ng
safety
More like this →