A comparative study of efficient initialization methods for the k-means clustering algorithm
Top Cited Papers
- 31 January 2013
- journal article
- Published by Elsevier BV in Expert Systems with Applications
- Vol. 40 (1), 200-210
- https://doi.org/10.1016/j.eswa.2012.07.021
Abstract
No abstract availableKeywords
This publication has 53 references indexed in Scilit:
- Improving the performance of k-means for color quantizationImage and Vision Computing, 2011
- Robust partitional clustering by outlier and density insensitive seedingPattern Recognition Letters, 2009
- Hierarchical initialization approach for K-Means clusteringPattern Recognition Letters, 2008
- A computational study of several relocation methods for k-means algorithmsPattern Recognition, 2003
- The global k-means clustering algorithmPattern Recognition, 2003
- Fast and robust fixed-point algorithms for independent component analysisIEEE Transactions on Neural Networks, 1999
- New methods for the initialisation of clustersPattern Recognition Letters, 1996
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithmPattern Recognition Letters, 1993
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- Comparing partitionsJournal of Classification, 1985