High-Dimensional Data Clustering

Details High-Dimensional Data Clustering High-Dimensional Data Clustering

2006-04-04

arxiv.org/abs/math/0604064v4

Computational Statistics and Data Analysis 52, 1 (2007) 502-519

Mathematics

Statistics Theory

Scientific paper

10.1016/j.csda.2007.02.009

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 live in different low-dimensional subspaces hidden in the original space. This paper presents a family of Gaussian mixture models designed for high-dimensional data which combine the ideas of dimension reduction and parsimonious modeling. 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. Our experiments on artificial and real datasets show that HDDC outperforms existing methods for clustering high-dimensional data

Affiliated with

Also associated with

No associations

Rating

High-Dimensional Data Clustering does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with High-Dimensional Data Clustering, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-Dimensional Data Clustering will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-501199