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

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

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

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 distribu ted 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-DrneansWM not only ensures the accuracy and efficiency of cluster cases, but also greatly improves the reliability and scalability of the system.