Sciweavers

1310 search results - page 3 / 262
» Learning the k in k-means
Sort
View
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
13 years 12 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
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 c...
Bodo Manthey, Heiko Röglin
FOCS
2006
IEEE
13 years 11 months ago
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
We investigate variants of Lloyd’s heuristic for clustering high dimensional data in an attempt to explain its popular
Rafail Ostrovsky, Yuval Rabani, Leonard J. Schulma...
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 5 months ago
How Fast Is the k-Means Method?
We present polynomial upper and lower bounds on the number of iterations performed by the k-means method (a.k.a. Lloyd's method) for k-means clustering. Our upper bounds are ...
Sariel Har-Peled, Bardia Sadri
PAMI
2002
243views more  PAMI 2002»
13 years 5 months ago
An Efficient k-Means Clustering Algorithm: Analysis and Implementation
Tapas Kanungo, David M. Mount, Nathan S. Netanyahu...
CORR
2011
Springer
154views Education» more  CORR 2011»
12 years 9 months ago
A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation
— This paper shows that the k-means quantization of a signal can be interpreted both as a crisp indicator function and as a fuzzy membership assignment describing fuzzy clusters ...
Nicolaie Popescu-Bodorin