| 基于密度的并行聚类算法 |
| |
| 引用本文： | 陈敏,高学东,栾绍峻,郗玉平.基于密度的并行聚类算法[J].计算机工程,2010,36(11):8-10. |
| |
| 作者姓名： | 陈敏 高学东 栾绍峻 郗玉平 |
| |
| 作者单位： | 1. 北京科技大学经济管理学院,北京,100083
2. 北京信息职业技术学院汽车工程系,北京,100015 |
| |
| 基金项目： | 国家自然科学基金资助项目“高维稀疏数据聚类研究”(70771007) |
| |
| 摘 要： | 为满足大规模空间数据库的聚类需求，面向计算机集群，提出一种基于密度的并行聚类算法。该算法根据数据库分布特征进行数据分区，在每一个节点上对数据块并行聚类，在主节点上合并聚类结果。实验结果表明，该算法的计算速度随着节点数的增多呈线性增加，具有较好的延展性。
|
| 关 键 词： | 并行聚类 计算机集群 数据库 延展性 |
Parallel Clustering Algorithm Based on Density |
| |
| CHEN Min,GAO Xue-dong,LUAN Shao-jun,XI Yu-ping.Parallel Clustering Algorithm Based on Density[J].Computer Engineering,2010,36(11):8-10. |
| |
| Authors: | CHEN Min GAO Xue-dong LUAN Shao-jun XI Yu-ping |
| |
| Affiliation: | (1. School of Economics and Management, University of Science and Technology Beijing, Beijing 100083; 2. Department of Automotive Engineering, Beijing Information Technology College, Beijing 100015) |
| |
| Abstract: | In order to meet the demands for large scale databases clustering, this paper proposes a parallel clustering algorithm based on density for computer colony. This algorithm goes on data partition according to database distribution feature, processes data block parallel clustering on every node, merges clustering result on main node. Experimental result shows that computing speed of this algorithm is linear increment with number of node increasing, and it has better extensibility. |
| |
| Keywords: | parallel clustering computer colony database extensibility parallel clustering computer colony database extensibility parallel clustering computer colony database extensibility |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
|
