Conference Papers Year : 2010

Clustering on Manifolds with Dual-Rooted Minimal Spanning Trees

Abstract

In this paper, we introduce a new distance computed from the construction of dual-rooted minimal spanning trees (MSTs). This distance extends Grikschat's approach, exhibits attractive properties and allows to account for both local and global neighborhood information. Furthermore, a function measuring the probability that a point belongs to a detected class is proposed. Some connections with diffusion maps are outlined. The dual-rooted tree-based distance (DRPT) allows us to construct a new affinity matrix for use in a spectral clustering algorithm, or leads to a new data analysis method. Results are presented on benchmark datasets.
Fichier principal
Vignette du fichier
GallMC10aalborg.pdf (157.39 Ko) Télécharger le fichier
Origin Explicit agreement for this submission
Loading...

Dates and versions

hal-00492745 , version 1 (16-06-2010)
hal-00492745 , version 2 (19-07-2010)

Identifiers

  • HAL Id : hal-00492745 , version 2

Cite

Laurent Galluccio, Olivier J.J. Michel, Pierre Comon. Clustering on Manifolds with Dual-Rooted Minimal Spanning Trees. EUSIPCO 2010 - 18th European Signal Processing Conference, Aug 2010, Aalborg, Denmark. ⟨hal-00492745v2⟩
227 View
299 Download

Share

More