| 基于最小树切割的自适应聚类方法 |
| |
| 引用本文： | 李玉鑑.基于最小树切割的自适应聚类方法[J].北京工业大学学报,2007,33(3):331-336. |
| |
| 作者姓名： | 李玉鑑 |
| |
| 作者单位： | 北京工业大学,计算机学院,多媒体与智能软件技术北京市重点实验室,北京,100022 |
| |
| 基金项目： | 北京市自然科学基金(4052005);;北京市属市管高等学校“中青年骨干教师培养计划”资助项目 |
| |
| 摘 要： | 为了简单有效地对数据集进行结构分析,提出了一种基于最小树进行聚类的算法(MSTCA)．其基本思想是在最小树中切割所有大于一定阈值的边,对数据集进行子类划分,同时对较小的子类进行合并．MSTCA产生的聚类结果在不考虑子类次序时是唯一的。对它的递归调用还可在若干不同粒度层次上形成数据集的聚类结构．计算实验表明,MSTCA不仅能为具有各种不同聚类形状的数据集自适应地选择较好的聚类个数,而且只需简单的参数选择就能准确地分析出数据中存在的合理聚类和例外样本．
|
| 关 键 词： | 最小树 阈值切割 聚类算法 聚类个数 层次聚类 |
| 文章编号： | 0254-0037(2007)03-0331-06 |
| 修稿时间： | 12 16 2005 12:00AM |
Adaptive Clustering Algorithm Based on Minimal Spanning Tree Cutting |
| |
| LI Yu-jian.Adaptive Clustering Algorithm Based on Minimal Spanning Tree Cutting[J].Journal of Beijing Polytechnic University,2007,33(3):331-336. |
| |
| Authors: | LI Yu-jian |
| |
| Affiliation: | Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology;College of Computer Science and Technology;Beijing University of Technology;Beijing 100022;China |
| |
| Abstract: | In order to analyze the structure of a dataset simply and efficiently,this paper proposes a new clus- tering algorithm based on minimal spanning tree:MSTCA.The basic idea of which is to partition a data set into subclasses by cutting all edges whose lengths are greater than a certain threshold in one of its minimal spanning tree,and to merge those relatively small subclasses at the same time.MSTCA can guarantee a u- nique clustering result without considering the order of subclasses,and the recursive call t... |
| |
| Keywords: | minimal spanning trees threshold cutting clustering algorithms number of clusters hierarchical clustering |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
