A near-optimal initial seed value selection in k-means means algorithm using a genetic algorithm

GP Babu, MN Murty - Pattern recognition letters, 1993 - Elsevier
The K-means algorithm for clustering is very much dependent on the initial seed values. We
use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting …
被引用次数：288 相关文章

A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

G Phanendra Babu… - Pattern Recognition …, 1993 - ui.adsabs.harvard.edu
The K-means algorithm for clustering is very much dependent on the initial seed values. We
use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting …

[引用][C] A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm

G PHANENDRA BABU… - Pattern recognition …, 1993 - pascal-francis.inist.fr
A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm
CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple …

[引用][C] A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm

GP Babu, MN Murty - Pattern Recognition Letters, 1993 - dl.acm.org
A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm |
Pattern Recognition Letters skip to main content ACM Digital Library home ACM home Google …

A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

PG Babu, NM Murty - Pattern Recognition Letters, 1993 - eprints.iisc.ac.in
The K-means algorithm for clustering is very much dependent on the initial seed values. We
use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting …

A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm

PG Babu, NM Murty - Pattern Recognition Letters, 1993 - eprints.iisc.ac.in
The K-means algorithm for clustering is very much dependent on the initial seed values. We
use a genetic algorithm to find a near-optimal partitioning of the given data set by selecting …

[引用][C] A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm

G PHANENDRA BABU… - Pattern recognition letters, 1993 - Elsevier