256 search results - page 1 / 52 » A practical comparison of two K-Means clustering algorithms |
CORR
2008
Springer
13 years 11 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...
ICIC
2005
Springer
14 years 4 months ago
2005
Springer
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
ISAAC
2009
Springer
14 years 5 months ago
2009
Springer
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...
TJS
2010
13 years 9 months ago
2010
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
ALGORITHMICA
2005
13 years 10 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 ...