k-means算法的并行化教程解析.docVIP

题 目：一种基于“云”计算平台的并行聚类 ——K-means算法设计与实现 摘 要 云计算(Cloud Computing)是分布式计算(Distributed Computing)、并行计算(Parallel Computing)和网格计算(Grid Computing)的发展,云计算是一种新兴的分布式并行计算环境或模式,云计算的出现使得数据挖掘技术的网络化和服务化将成为新的趋势。 本文是对并行聚类算法K-means的研究。首先介绍了K-means算法在单个计算机上的聚类算法的设计思想,其次重点对K-means算法在集群环境下聚类算法的设计思想进行具体阐述。 K-means聚类算法在面对海量数据时,时间和空间的复杂性已成为 K-means聚类算法的瓶颈。本文在充分研究传统 K-Means聚类算法的基础上, 提出了基于的并行 K-Means聚类算法的设计思想, 给出了其加速比估算公式。并通过实验证明了该算法的正确性和有效性。 关键字：K-means；并行；聚类；集群环境 Abstract Cloud Computing, which is a nascent distributed parallel computing environment or pattern, is the development of Distributed Computing, Parallel Computing and Grid Computing. The appearance of Cloud Computing makes the network and the service of the data mining technology become a new trend. The paper is a study of K-means which is among the parallel clustering algorithms. Firstly, it illustrates the design ideology of clustering algorithm of K-means algorithm on the every single computer. Secondly, it mainly elaborates the design ideology of K-means algorithm of clustering algorithms working in the clustering environment. Being confronted with a large quantity of data, the complexity of time and space has been the bottleneck of K-means. Based on the sufficient studies of traditional K-means, the paper puts forward the design ideology on the basis of the parallel K-means clustering algorithms and provides its estimation formula of speed-up ratio. The paper also proves the accuracy and the effectiveness of this algorithm by the means of the experiments. Key Words: K-means；Parallel; Clustering; Cluster environment 摘 要 I Abstract II 目 录 III 1引言 1 1.1研究意义 1 1.2并行聚类算法国内外研究现状 1 2．聚类算法和Hadoop综述 2 2.1 聚类算法简介 2 2.2 Hadoop平台简介 3 3．K-means聚类算法分析 4 4．K-means聚类算法并行原理分析 7 4.1 K-means聚类算法并行原理分析 7 4.2 算法描述 8 4.4 算法复杂度分析 9 5 基于Mapreduce的K-means并行算法的具体实现思想 10 6 实验与结果 13 参考文献 I 致 谢 III  1引言 1.1研究意义 数据挖掘（Data Mining）KDD）,是从大量的、不完全的、有噪声的、模糊的、随机的数据中,提取隐含在其中未知的、有潜在应用价值的信息或模式的过程。计算机技术的迅猛发展以及网络的普及,使人们有更多机会使用便捷的方法与外界进行信息交流。可是