Parallel K-Means Clustering Based on MapReduce

  • Authors:

  • Weizhong Zhao;Huifang Ma;Qing He

  • Affiliations:

  • The Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, and Graduate University of Chinese Academy of Sciences,;The Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, and Graduate University of Chinese Academy of Sciences,;The Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences,

  • Venue:
  • CloudCom '09 Proceedings of the 1st International Conference on Cloud Computing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data clustering has been received considerable attention in many applications, such as data mining, document retrieval, image segmentation and pattern classification. The enlarging volumes of information emerging by the progress of technology, makes clustering of very large scale of data a challenging task. In order to deal with the problem, many researchers try to design efficient parallel clustering algorithms. In this paper, we propose a parallel k -means clustering algorithm based on MapReduce, which is a simple yet powerful parallel programming technique. The experimental results demonstrate that the proposed algorithm can scale well and efficiently process large datasets on commodity hardware.