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.
Liste complète des métadonnées

Littérature citée [2 références]  Voir  Masquer  Télécharger


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

Fichiers

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

Identifiants

Partager

Métriques

Consultations de la notice

430

Téléchargements de fichiers

1210