|
|||||
|
|
| 一种新的基于层次凝聚的高效复合聚类算法 | |
| 引用本文： | 赵春,潘建平,陈璟. 一种新的基于层次凝聚的高效复合聚类算法[J]. 科技通报, 2012, 28(4): 125-127 |
| 作者姓名： | 赵春 潘建平 陈璟 |
| 作者单位： | 1. 四川大学锦城学院计算机科学与软件工程系,成都,611731 2. 重庆交通大学土木建筑学院,重庆,400074 3. 四川省经济信息中心,成都,610016 |
| 摘 要： | 复合聚类算法是在改进的单连接算法和基于距离的聚合算法的基础上叠加形成。改进传统的单连接算法可以缩短数据聚合的时间,而基于距离的聚合算法则可以增大结点规模,满足数据量大、复杂度高的要求。实验结果表明,采用复合聚类算法能够有效地提高数据聚集的准确率和缩短响应时间。 |
| 关 键 词： | 层次凝聚 单连接算法 基于距离的聚类 复合聚类 |
A New Efficient Combined Clustering Algorithm Based on Agglomerative Hierarchical |
|
| ZHAO Chun , PAN Jianping , CHEN Jin. A New Efficient Combined Clustering Algorithm Based on Agglomerative Hierarchical[J]. Bulletin of Science and Technology, 2012, 28(4): 125-127 | |
| Authors: | ZHAO Chun PAN Jianping CHEN Jin |
| Affiliation: | Jin3(1.Computer Science Department,Sichuan University Jincheng College,Chengdu 611731,China; 2.College of Civil Engineering and Architecture,Chongqing Jiaotong University,Chongqing 400074,China; 3.Sichuan Economic Information Center,Chengdu,610016,China) |
| Abstract: | The combined-clustering algorithm is formed based on Single-linkage-improved algorithms and k-means-improved algorithm.Single-linkage-improved algorithm can shorten clustering time.,and k-means algorithm can meet the need of huge volumes of data and high complexity,because it can enlarge the scale of nodes.The experiment shows that the combined-clustering algorithm can effectively improve accuracy and shorten handle time of data clustering. |
| Keywords: | hierarchical agglomeration single-linkage algorithm k-means combined-clustering |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |