| 一种分布式的K-means聚类算法 |
| |
| 引用本文： | 梁建武,田野.一种分布式的K-means聚类算法[J].现代电子技术,2010,33(10):11-14. |
| |
| 作者姓名： | 梁建武 田野 |
| |
| 作者单位： | 中南大学,信息科学与工程学院,湖南,长沙,410075 |
| |
| 基金项目： | 国家自然科学基金，湖南省自然科学基金 |
| |
| 摘 要： | 提出一种适用于大型数据集的分布式聚类算法。该算法以传统的K-means算法为基础进行合理的改进,使之更适用于分布式环境,并从算法的复杂度分析,将该算法与传统的集中式K-means算法及其他分布式算法进行比较。实验表明,该算法在保持了集中式K-means算法所有必要特性的同时,提高了数据处理速度。
|
| 关 键 词： | K-means聚类算法 分布式环境 大数据集 复杂度 |
Distributed K-means Clustering Algorithm |
| |
| LIANG Jian-wu,TIAN Ye.Distributed K-means Clustering Algorithm[J].Modern Electronic Technique,2010,33(10):11-14. |
| |
| Authors: | LIANG Jian-wu TIAN Ye |
| |
| Affiliation: | LIANG Jian-wu,TIAN Ye (School of Information Science , Engineering,Central South University,Changsha 410075,China) |
| |
| Abstract: | A distributed clustering algorithm suit for large data sets is presented.This algorithm is a modified version of the common K-means algorithm with suitable change for making it executable in distributed environment.The algorithm,the traditional serial K-means algorithm and other existing algorithms are compared on the basis of analysing the complexity of the algorithm.Experimental results show that this distributed algorithm maintains all necessary characteristics of the serial K-means algorithm,as well imp... |
| |
| Keywords: | K-means algorithm distributed environment large database complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
