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

覆盖聚类算法
引用本文:赵姝,张燕平,张铃,张媛,陈传明.覆盖聚类算法[J].安徽大学学报(自然科学版),2005,29(2):28-32.
作者姓名:赵姝  张燕平  张铃  张媛  陈传明
作者单位:安徽大学,计算智能与信号处理教育部重点实验室,安徽,合肥,230039
基金项目:国家自然科学基金;60135010,60175018;
摘    要:首先比较几类主要的聚类算法,给出每类算法的基本概念、原理、每类的代表性算法,及这些算法的主要特征。在此分析基础上,提出一种新的聚类算法———覆盖聚类算法,该算法采用覆盖的概念将比较集中的样本聚合在一起,从而发现隐含在样本集中的类,对于周围稀疏的样本结合最短距离法,获得聚类效果,并用实验数据对分层聚类方法、LBG方法与覆盖聚类算法进行比较,证明了覆盖聚类算法的可行性和有效性。最后给出了算法的研究方向。

关 键 词:聚类算法  覆盖聚类  分层聚类
文章编号:1000-2162(2005)02-0028-05

Covering clustering algorithm
ZHAO Shu,ZHANG Yan-ping,ZHANG Ling,ZHANG Yuan,CHEN Chuan-ming.Covering clustering algorithm[J].Journal of Anhui University(Natural Sciences),2005,29(2):28-32.
Authors:ZHAO Shu  ZHANG Yan-ping  ZHANG Ling  ZHANG Yuan  CHEN Chuan-ming
Abstract:This paper firstly compares some main clustering algorithms. It presents the basic concepts, principles of each algorithm and representative clustering methods of each category algorithms, it compares the main characters of these algorithms. A new clustering algorithm,covering clustering algorithm is put forward in this paper. It uses the ideas of covering clustering the relatively dense samples,which are clusters.For the sparse samples, we use the method of the shortest distance interlinking them to achieve the results, we also compare the hierarchical clustering methods,LBG method and covering clustering method with experimental results. And the results show the feasibility and effectiveness of the covering clustering algorithm. Finally, this paper points out the research directions of the algorithm.
Keywords:clustering algorithms  covering clustering  hierarchical clustering
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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