计算机科学 ›› 2010, Vol. 37 ›› Issue (1): 39-41.

• 计算机网络与信息安全 • 上一篇    下一篇

k-DmeansWM:一种基于P2P网络的分布式聚类算法

李榴,唐九阳,葛斌,肖卫东,汤大权   

  1. (国防科技大学信息系统与管理学院 长沙410073)
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家自然科学基金项目(60772012),湖南省自然科学基金项目(03JJY3110)资助。

k-DmeansWM:An Effective Distributed Clustering Algorithm Based on P2P

LI Liu,PANG Jiu-yang,GE Bin,XIAO Wei-dong,TANG Da-quan   

  • Online:2018-12-01 Published:2018-12-01

摘要: 传统的分布式聚类算法设立中心节点来实现聚类过程的控制,这不仅降低了系统可靠性,而且容易出现单点失效问题。提出一种基于P2P网络的分布式聚类算法k-Dmeans Without Master(简称k-DmeansWM),即采用对等分布的思想,摒弃中心节点,完全由对等节点来实现聚类过程的控制。理论分析与实验结果表明,k-DmeansWM在保证聚类准确性与效率的情况下,大大提高了系统的可靠性与扩展性。

关键词: 分布式聚类,P2P,可靠性

Abstract: Centralized master node is established in normal distributed clustering algorithms in order to control clustering 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-I?meansWM not only ensures the accuracy and efficiency of cluster cases, but also greatly improves the reliability and scalability of the system.

Key words: Distributed clustering, P2P, Reliability

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!