| 本文已被：浏览 5943次 下载 9375次 |
码上扫一扫！ |
|
|
| 复杂分布数据的二阶段聚类算法 |
|
公茂果1,2, 王爽1,2, 马萌1,2, 曹宇1,2, 焦李成1,2, 马文萍1,2
|
|
1.西安电子科技大学 智能感知与图像理解教育部重点实验室,陕西 西安 710071;2.西安电子科技大学 智能信息处理研究所,陕西 西安 710071
|
|
| 摘要: |
| 提出了一种用于复杂分布数据的二阶段聚类算法(two-phase clustering,简称TPC),TPC 包含两个阶段:首先将数据划分为若干个球形分布的子类,每一个子类用其聚类中心代表该类内的所有样本;然后利用可以处理复杂分布数据的流形进化聚类(manifold evolutionary clustering,简称MEC)对第1 阶段得到的聚类中心进行类别划分;最后综合两次聚类结果整理得到最终聚类结果.该算法基于改进的K-均值算法和MEC 算法.在进化聚类算法的基础上引入流形距离,使得算法能够胜任复杂分布的数据聚类问题.同时,算法降低了引入流形距离所带来的计算量.在分布各异的7 个人工数据集和7 个UCI 数据集测试了二阶段聚类算法,并将其效果与遗传聚类算法、K 均值算法和流形进化聚类算法做了比较.实验结果表明,无论对于简单或复杂、凸或非凸的数据,TPC 都表现出良好的聚类性能,并且计算时间与MEC 相比明显减少. |
| 关键词: 数据挖掘 聚类 K-均值算法 进化算法 流形 |
| DOI：10.3724/SP.J.1001.2011.03903 |
| 分类号: |
| 基金项目:国家高技术研究发展计划(863)(2009AA12Z210); 新世纪优秀人才支持计划(NCET-08-0811); 陕西省科技新星支持计划(2010KJXX-03); 中央高校基本科研业务费重点项目(K50510020001) |
|
| Two-Phase Clustering Algorithm for Complex Distributed Data |
|
GONG Mao-Guo1,2, WANG Shuang1,2, MA Meng1,2, CAO Yu1,2, JIAO Li-Cheng1,2, MA Wen-Ping1,2
|
|
1.Key Laboratory of Intelligent Perception and Image Understanding of the Ministry of Education, Xidian University, Xi’an 710071, China;2.Institute of Intelligent Information Processing, Xidian University, Xi’an 710071, China
|
| Abstract: |
| In this paper, a Two-Phase Clustering (TPC) for the data sets with complex distribution is proposed. TPC contains two phases. First, the data set is partitioned into some sub-clusters with spherical distribution, and each clustering center represents all the members of its corresponding cluster. Then, by utilizing the outstanding clustering performance of the Manifold Evolutionary Clustering (MEC) for acomplex distributed data, the clustering centers obtained in the first phase are clustered. Finally, based on these two clustering results, the final results are obtained. This algorithm is based on an improved K-means, and the MEC. Manifold distance is introduced in evolutionary clustering to make the algorithm competent for the clustering of complex data sets. At the same time, the novel method reduces the computational cost brought by manifold distance. Experimental results on seven artificial data sets and seven UCI data sets with different structure show that the novel algorithm has the ability to identify clusters with simple or complex, convex, or non-convex distribution efficiently, compared with the genetic algorithm-based clustering, the K-means algorithm, and the manifold evolutionary clustering. Furthermore, TPC outperforms MEC obviously in terms of computational time. |
| Key words: data mining clustering K-means algorithm evolutionary algorithm manifold |
