Clustering Stable Instances of Euclidean k-means

Abhratanu Dutta
Abhratanu Dutta
Alex Wang
Alex Wang

ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 30 (NIPS 2017), pp. 6500-6509, 2017.

Cited by: 2|Bibtex|Views3|Links
EI

Abstract:

The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like Lloyd's algorithm for this problem. To address this disconnect, we study the following question: what ...More

Code:

Data:

Your rating :
0

 

Tags
Comments