Sciweavers

19 search results - page 1 / 4
» FGKA: a Fast Genetic K-means Clustering Algorithm
Sort
View
SAC
2004
ACM
14 years 4 months ago
FGKA: a Fast Genetic K-means Clustering Algorithm
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...
MLDM
2010
Springer
13 years 5 months ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
BMCBI
2004
158views more  BMCBI 2004»
13 years 10 months ago
Incremental genetic K-means algorithm and its application in gene expression data analysis
Background: In recent years, clustering algorithms have been effectively applied in molecular biology for gene expression data analysis. With the help of clustering algorithms suc...
Yi Lu, Shiyong Lu, Farshad Fotouhi, Youping Deng, ...
ISAAC
2005
Springer
122views Algorithms» more  ISAAC 2005»
14 years 4 months ago
Fast k-Means Algorithms with Constant Approximation
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
ALGORITHMICA
2005
108views more  ALGORITHMICA 2005»
13 years 10 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