Gp. Babu et Mn. Murty, A NEAR-OPTIMAL INITIAL SEED VALUE SELECTION IN K-MEANS ALGORITHM USING A GENETIC ALGORITHM, Pattern recognition letters, 14(10), 1993, pp. 763-769
Citations number
8
Categorie Soggetti
Computer Sciences, Special Topics","Computer Applications & Cybernetics
The K-means algorithm for clustering is very much dependent on the ini
tial seed values. We use a genetic al to find a near-optimal partition
ing of the given data set by selecting proper initial seed values in t
he K-means algorithm. Results obtained are very encouraging and in mos
t of the cases, on data sets having well separated clusters, the propo
sed scheme reached a global minimum.