High dimensional data clustering - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

High dimensional data clustering

Résumé

Clustering in high-dimensional spaces is a recurrent problem in many domains, for example in object recognition. High-dimensional data usually live in different lowdimensional subspaces hidden in the original space. This paper presents a clustering approach which estimates the specific subspace and the intrinsic dimension of each class. Our approach adapts the Gaussian mixture model framework to high-dimensional data and estimates the parameters which best fit the data. We obtain a robust clustering method called High- Dimensional Data Clustering (HDDC). We apply HDDC to locate objects in natural images in a probabilistic framework. Experiments on a recently proposed database demonstrate the effectiveness of our clustering method for category localization.
Fichier principal
Vignette du fichier
paper_COMPSTAT06.pdf (203.25 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00548591 , version 1 (06-01-2011)

Identifiants

  • HAL Id : inria-00548591 , version 1

Citer

Charles Bouveyron, Stéphane Girard, Cordelia Schmid. High dimensional data clustering. 17th International Conference on Computational Statistics (Compstat '06), Aug 2006, Rome, Italy. pp.813--820. ⟨inria-00548591⟩
303 Consultations
1365 Téléchargements

Partager

Gmail Facebook X LinkedIn More