Robust Algorithms for Online k-means Clustering

Aditya Bhaskara, Aravinda Kanchana Ruwanpathirana

Abstract: In the online version of the classic $k$-means clustering problem, the points of a dataset $u_1, u_2, …$ arrive one after another in an arbitrary order. When the algorithm sees a point, it should e...