inria-00321515, version 1
The global k-means clustering algorithm
Aristidis Likas
a, 1Nikos Vlassis b, 2Jakob Verbeek c, 2
N° IAS-UVA-01-02 (2001)
Abstract: We present the global k-means algorithm which is an incremental approach to clustering that dynamically adds one cluster 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 methods 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.
- a – University of Ioannina
- b – Technical University of Crete
- c – Universiteit van Amsterdam
- 1: Department of Computer Science
- University of Ioannina
- 2: Instituut voor Informatica (IvI)
- Universiteit van Amsterdam
- Domain : Computer Science/Learning
- Keywords : Clustering – k-means algorithm – global optimization – k-d trees – data mining
- Internal note : IAS-UVA-01-02
- inria-00321515, version 1
- http://hal.inria.fr/inria-00321515
- oai:hal.inria.fr:inria-00321515
- From: Jakob Verbeek
- Submitted on: Wednesday, 16 February 2011 17:03:46
- Updated on: Friday, 18 February 2011 14:08:09
Associated documents
Export