总结了高维数据聚类算法的研究现状,分析比较了算法性能的主要差异,并指出其今后的发展趋势,即在子空间聚类过程中融入其他传统聚类方法的思想,以提高聚类性能。
This paper provided a survey of current clustering algorithms for high-dimensional data at first, then made a comparison among them and identifized the new direction in the future, which was the combination of subspace clustering and other typical clustering methods.