Worst-case and smoothed analysis of $k$-means clustering with Bregman divergences


Share/Save/Bookmark

Manthey, Bodo and Röglin, Heiko (2009) Worst-case and smoothed analysis of $k$-means clustering with Bregman divergences. In: 20th International Symposium on Algorithms and Computation, ISAAC 2009, 16-18 Dec 2009, Honolulu, Hawaii, USA.

[img]PDF
Restricted to UT campus only
: Request a copy
328Kb
Abstract:The $k$-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the case that squared Euclidean distances are used as similarity measure. In many applications, however, data is to be clustered with respect to other measures like, e.g., relative entropy, which is commonly used to cluster web pages. In this paper, we analyze the running-time of the $k$-means method for Bregman divergences, a very general class of similarity measures including squared Euclidean distances and relative entropy. We show that the exponential lower bound known for the Euclidean case carries over to almost every Bregman divergence. To narrow the gap between theory and practice, we also study $k$-means in the semi-random input model of smoothed analysis. For the case that $n$ data points in $\mathbb{R}^d$ are perturbed by noise with standard deviation $\sigma,$ we show that for almost arbitrary Bregman divergences the expected running-time is bounded by poly($n^{\sqrt k}, 1/\sigma$) and $k^{kd}$ poly($n, 1/\sigma$).
Item Type:Conference or Workshop Item
Copyright:© 2009 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/68761
Official URL:http://dx.doi.org/10.1007/978-3-642-10631-6_103
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page