首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于Chameleon算法和谱平分法的聚类新方法
引用本文:张友,赵凤霞.基于Chameleon算法和谱平分法的聚类新方法[J].大连民族学院学报,2010,12(1):61-64.
作者姓名:张友  赵凤霞
作者单位:1. 大连民族学院,理学院,辽宁,大连,116605
2. 秦皇岛职业技术学院,信息工程系,河北,秦皇岛,066100
摘    要:在分析传统的聚类算法优越性和存在不足的基础上,基于Chameleon算法和谱平分法的思想提出了一种新的聚类方法。相比传统聚类算法而言此算法克服了如k—means算法、EM算法等传统聚类算法在聚类不为凸的样本空间时容易陷入局部最优的缺点,能在任意形状的样本空间上聚类,且收敛于全局最优解,并且可以降低噪声和离群点的影响,提高了算法的有效性。在UCI数据集和5个特殊的二维数据点组成的数据集上进行了实验,证明了本方法的有效性。

关 键 词:聚类算法  Chameleon算法  谱平分法  k—mean算法  EM算法  不为凸的样本空间

A New Clustering Method Based on the Chameleon Algorithm and the Spectral Bisection Method
ZHANG You,ZHAO Feng-xia.A New Clustering Method Based on the Chameleon Algorithm and the Spectral Bisection Method[J].Journal of Dalian Nationalities University,2010,12(1):61-64.
Authors:ZHANG You  ZHAO Feng-xia
Institution:1.College of Science;Dalian Nationalities University;Dalian Liaoning 116605;China;2.Department of Information Engineering;Qinhuangdao Institute of Technology;Qinhuangdao Hebei 066100;China
Abstract:With analysis of advantages and disadvantages of traditional clustering algorithms,we proposed a new clustering method based on the Chameleon algorithm and the spectral bisection method.Unlike traditional clustering algorithms,this algorithm overcomes a disadvantage of some traditional clustering algorithms such as the k-means algorithm and the EM algorithm,that is,they are prone to local optimum when clustering on a nonconvex sample space.It is capable of clustering on a sample space of any shape and conve...
Keywords:clustering algorithm  the Chameleon algorithm  the spectral bisection method  the k-means algorithm  the EM algorithm  nonconvex sample space  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号