The k-means algorithm is one of the most widely used clustering heuristics. Despite its simplicity, analyzing its running time and quality of approximation is surprisingly difficult and can lead to deep insights that can be used to improve the algorithm. In this paper we survey the recent results in this direction as well as several extension of the basic k-means method.
No takes yet. Share an insight, caveat, or question.
Blömer et al. (2016) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: