SOURCE-LINKED INTELLIGENCE

Individual Fairness in Hierarchical Clustering

arXiv · AI, language, vision and robotics · article · Aug 26, 2026 · UTC

Hierarchical clustering produces ultrametric representations that impose strong global geometric constraints and may distort local similarities in ways that disproportionately affect individual data points. We study hierarchical clustering under an individual fairness requirement that bounds relative distortion within local $k$-nearest neighborhoods. We formulate this requirement as a feasibility problem over dominated ultrametrics and characterize the minimal multiplicative slack required for feasibility. We identify a sharp local threshold, prove stability under bounded perturbations, establ

Read original source ↗ Open in workspace

recordType

paper

region

Global