High dimensional data clustering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

High dimensional data clustering


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
Origin : Files produced by the author(s)

Dates and versions

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


  • HAL Id : inria-00548591 , version 1


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⟩
297 View
1336 Download


Gmail Facebook Twitter LinkedIn More