arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0604064math.STstat.TH
收藏

高维数据聚类

High-Dimensional Data Clustering

Charles Bouveyron, Stéphane Girard, Cordelia Schmid

摘要:

高维空间中的聚类问题是一个在许多领域中经常出现的难题,例如在图像分析中。困难是由于高维数据通常存在于原始空间中隐藏的不同低维子空间中。本文结合降维和简约建模的思想,提出了一类针对高维数据的高斯混合模型。这些模型产生了一种基于期望最大化算法的聚类方法,称为高维数据聚类(HDDC)。为了正确地拟合数据,HDDC估计每个组的特定子空间和固有维数。我们在人工和真实数据集上的实验表明,HDDC在聚类高维数据方面优于现有的方法

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑