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 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.
Type de document :
Rapport
[Technical Report] IAS-UVA-01-02, 2001, pp.12
Liste complète des métadonnées


https://hal.inria.fr/inria-00321515
Contributeur : Jakob Verbeek <>
Soumis le : mercredi 16 février 2011 - 17:03:46
Dernière modification le : lundi 25 septembre 2017 - 10:08:04
Document(s) archivé(s) le : mardi 17 mai 2011 - 02:38:06

Fichiers

verbeek01tr.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00321515, version 1

Collections

Citation

Aristidis Likas, Nikos Vlassis, Jakob Verbeek. The global k-means clustering algorithm. [Technical Report] IAS-UVA-01-02, 2001, pp.12. 〈inria-00321515〉

Partager

Métriques

Consultations de la notice

340

Téléchargements de fichiers

4904