High-dimensional data clustering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2006

High-dimensional data clustering


Clustering in high-dimensional spaces is a difficult problem which is recurrent in many domains, for example in image analysis. The difficulty is due to the fact that high-dimensional data usually exist in different low-dimensional subspaces hidden in the original space. A family of Gaussian mixture models designed for high-dimensional data which combine the ideas of subspace clustering and parsimonious modeling are presented. These models give rise to a clustering method based on the expectation-maximization algorithm which is called high-dimensional data clustering (HDDC). In order to correctly fit the data, HDDC estimates the specific subspace and the intrinsic dimension of each group. Experiments on artificial and real data sets show that HDDC outperforms existing methods for clustering high-dimensional data.
No file

Dates and versions

inria-00548573 , version 1 (20-12-2010)


  • HAL Id : inria-00548573 , version 1


Charles Bouveyron, Stéphane Girard, Cordelia Schmid. High-dimensional data clustering. [Research Report] 2006. ⟨inria-00548573⟩
225 View
0 Download


Gmail Facebook X LinkedIn More