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 -IP stable when each data point's average distance to its cluster is no more than 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( 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, O(nk).

Tasks

Reproductions