512 search results - page 3 / 103 » k-Means Projective Clustering |
ALGORITHMICA
2005
13 years 5 months ago
2005
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 ...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
— 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 ...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The k-means method is a widely used clustering algorithm. One of its distinguished features is its speed in practice. Its worst-case running-time, however, is exponential, leaving...
ICDAR
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper, we propose a new method based on wavelet transform, statistical features and central moments for both graphics and scene text detection in video images. The method ...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...