| k-DmeansWM:一种基于P2P网络的分布式聚类算法 |
| |
| 引用本文： | 李榴,唐九阳,葛斌,肖卫东,汤大权.k-DmeansWM:一种基于P2P网络的分布式聚类算法[J].计算机科学,2010,37(1):39-41. |
| |
| 作者姓名： | 李榴 唐九阳 葛斌 肖卫东 汤大权 |
| |
| 作者单位： | 国防科技大学信息系统与管理学院,长沙,410073 |
| |
| 基金项目： | 国家自然科学基金项目(60172012);;湖南省自然科学基金项目(03JJY3110)资助 |
| |
| 摘 要： | 传统的分布式聚类算法设立中心节点来实现聚类过程的控制,这不仅降低了系统可靠性,而且容易出现单点失效问题。提出一种基于P2P网络的分布式聚类算法k-Dmeans Without Master(简称k-DmeansWM),即采用对等分布的思想,摒弃中心节点,完全由对等节点来实现聚类过程的控制。理论分析与实验结果表明,k-DmeansWM在保证聚类准确性与效率的情况下,大大提高了系统的可靠性与扩展性。
|
| 关 键 词： | 分布式聚类 P2P 可靠性 |
| 收稿时间： | 2009/2/25 0:00:00 |
| 修稿时间： | 5/8/2009 12:00:00 AM |
k-DmeansWM:An Effective Distributed Clustering Algorithm Based on P2P |
| |
| LI Liu,PANG Jiu-yang,GE Bin,XIAO Wei-dong,TANG Da-quan.k-DmeansWM:An Effective Distributed Clustering Algorithm Based on P2P[J].Computer Science,2010,37(1):39-41. |
| |
| Authors: | LI Liu PANG Jiu-yang GE Bin XIAO Wei-dong TANG Da-quan |
| |
| Affiliation: | College of Information Systems and Management/a>;National University of Defense Technology/a>;Changsha 410073/a>;China |
| |
| Abstract: | Centralized master node is established in normal distributed clustering algorithms in order to control clus-tering processes,which reduce the system's reliability,single point failure problem occurs easily.The effective distributed clustering algorithm k-Dmeans Without Master(k-DmeansWM) based on peer-to-peer concepts,which abandons the master node,uses peer nodes to achieve controlling of the clustering process entirely.Both theoretical analysis and experimental results show that k-DmeansWM not only ensure... |
| |
| Keywords: | Distributed clustering P2P Reliability |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
