Combining multiple partitions created with a graph-based construction for data clustering - C2S Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Combining multiple partitions created with a graph-based construction for data clustering

Résumé

This paper focusses on a new clustering method called evidence accumulation clustering with dual rooted prim tree cuts (EAC-DC), based on the principle of cluster ensembles also known as ''combining multiple clustering methods". A simple weak clustering algorithm is introduced based upon the properties of dual rooted minimal spanning trees and it is extended to multiple rooted trees. Co-association measures are proposed that account for the cluster sets obtained by these methods. These are exploited in order to obtain new ensemble consensus clustering algorithms. The EAC-DC methodology applied to both real and synthetic data sets demonstrates the superiority of the proposed methods.
Fichier principal
Vignette du fichier
GallMCHK09grenoble_final.pdf (225.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00399928 , version 1 (29-06-2009)

Identifiants

  • HAL Id : hal-00399928 , version 1

Citer

Laurent Galluccio, Olivier J.J. Michel, Pierre Comon, Alfred O. Hero, Mark Kliger. Combining multiple partitions created with a graph-based construction for data clustering. MLSP 2009 - IEEE 19th International Workshop on Machine Learning for Signal Processing, Sep 2009, Grenoble, France. ⟨hal-00399928⟩
289 Consultations
143 Téléchargements

Partager

Gmail Facebook X LinkedIn More