Reference : The global k-means clustering algorithm
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/11064
The global k-means clustering algorithm
English
Likas, Aristidis []
Vlassis, Nikos mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
Verbeek, Jakob J. []
2003
Pattern Recognition
Pergamon Press - An Imprint of Elsevier Science
36
2
451-461
Yes (verified by ORBilu)
0031-3203
[en] 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 modifications of the method to reduce the computational load without significantly affecting 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.
http://hdl.handle.net/10993/11064

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
download.pdfPublisher postprint240.5 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.