The paper defines a linear program that detects outliers and, together with a rounding algorithm, gives constant-factor approximations for individually fair k-means and k-median clustering with outliers.
In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2024 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Linear Programming based Approximation to Individually Fair k-Clustering with Outliers
The paper defines a linear program that detects outliers and, together with a rounding algorithm, gives constant-factor approximations for individually fair k-means and k-median clustering with outliers.