The global k-means clustering algorithm - Archive ouverte HAL Access content directly
Journal Articles Pattern Recognition Year : 2003

The global k-means clustering algorithm

Nikos Vlassis
  • Function : Author
  • PersonId : 853678
Jakob Verbeek


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.
Vignette du fichier
LVV03.png (59.87 Ko) Télécharger le fichier Fichier principal
Vignette du fichier
verbeek03pr.pdf (156.63 Ko) Télécharger le fichier
Format : Figure, Image
Origin : Files produced by the author(s)

Dates and versions

inria-00321493 , version 1 (16-02-2011)



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⟩
306 View
2511 Download



Gmail Facebook Twitter LinkedIn More