Skip to Main content Skip to Navigation
New interface
Journal articles

The global k-means clustering algorithm

Abstract : We present the global k-means algorithm which is an incremental approach to clustering that dynamically adds one cluster center at a time through a deterministic global search procedure consisting of N (with N being the size of the data set) executions of the k-means algorithm from suitable initial positions. We also propose modi2cations of the method to reduce the computational load without signi2cantly a3ecting solution quality. The proposed clustering methods are tested on well-known data sets and they compare favorably to the k-means algorithm with random restarts.
Document type :
Journal articles
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download
Contributor : Jakob Verbeek Connect in order to contact the contributor
Submitted on : Wednesday, February 16, 2011 - 4:10:45 PM
Last modification on : Monday, September 25, 2017 - 10:08:04 AM
Long-term archiving on: : Tuesday, May 17, 2011 - 2:28:43 AM


Files produced by the author(s)



Aristidis Likas, Nikos Vlassis, Jakob Verbeek. The global k-means clustering algorithm. Pattern Recognition, 2003, 36 (2), pp.451 - 461. ⟨10.1016/S0031-3203(02)00060-2⟩. ⟨inria-00321493⟩



Record views


Files downloads