Differentially private $k$-means clustering via exponential mechanism and max cover

Anamay Chaturvedi, Huy Nguyen, Eric Xu

We introduce a new $({\epsilon }_p,{\delta }_p)$-differentially private algorithm for the $k$-means clustering problem. Given a dataset in Euclidean space, the $k$-means clustering problem requires…