Scalable Algorithms for Individual Preference Stable Clustering
Abstract
In this paper, we study the individual preference (IP) stability, which is an notion capturing individual fairness and stability in clustering. Within this setting, a clustering is $\alpha$-IP stable when each data point’s average distance to its cluster is no more than $\alpha$ times its average distance to any other cluster. In this paper, we study the natural local search algorithm for IP stable clustering. Our analysis confirms a $O(\log n)$-IP stability guarantee for this algorithm, where $n$ denotes the number of points in the input. Furthermore, by refining the local search approach, we show it runs in an almost linear time, $\tilde{O}(nk)$.
Cite
Text
Mosenzon and Vakilian. "Scalable Algorithms for Individual Preference Stable Clustering." Artificial Intelligence and Statistics, 2024.Markdown
[Mosenzon and Vakilian. "Scalable Algorithms for Individual Preference Stable Clustering." Artificial Intelligence and Statistics, 2024.](https://mlanthology.org/aistats/2024/mosenzon2024aistats-scalable/)BibTeX
@inproceedings{mosenzon2024aistats-scalable,
title = {{Scalable Algorithms for Individual Preference Stable Clustering}},
author = {Mosenzon, Ron and Vakilian, Ali},
booktitle = {Artificial Intelligence and Statistics},
year = {2024},
pages = {1108-1116},
volume = {238},
url = {https://mlanthology.org/aistats/2024/mosenzon2024aistats-scalable/}
}