Towards explaining the speed of $k$-means

Share/Save/Bookmark

Manthey, Bodo (2011) Towards explaining the speed of $k$-means. Nieuwsbrief van de Nederlandse Vereniging voor Theoretische Informatica, 2011 . pp. 45-54.

[img]
Preview
PDF
277Kb
Abstract:The $k$-means method is a popular algorithm for clustering, known for its speed in practice. This stands in contrast to its exponential worst-case running-time. To explain the speed of the $k$-means method, a smoothed analysis has been conducted. We sketch this smoothed analysis and a generalization to Bregman divergences.
Item Type:Article
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/79466
Official URL:http://www.nvti.nl/Newsletter/Nieuwsbrief2011.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page