Home > Papers

 
 
K-means Clustering Distributed Data Mining Based on Hadoop
XIAO Shan #,YU Yanhua *,YANG Zhifang,E Xinhua
School of Computer Science,Beijing University of Posts and Telecommunications, Beijing 100876
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online: 9 December 2011
Accepted by: none
Citation: XIAO Shan,YU Yanhua,YANG Zhifang.K-means Clustering Distributed Data Mining Based on Hadoop[OL]. [ 9 December 2011] http://en.paper.edu.cn/en_releasepaper/content/4453607
 
 
In the face of massive data on the Internet, a single host has been unable to meet their storage and computing requirements, distributed storage and distributed computing applications is an inevitable trend. Hadoop is the application of which more distributed storage and computing frameworks. Various features of the Hadoop is ideal for data mining, this paper presents a Hadoop-based framework for distributed data mining model, and give the corresponding Map / Reduce process of design ideas and examples for distributed data mining.
Keywords:Data Mining;Distributed applications;Hadoop;K-means clustering
 
 
 

For this paper
  • ● PDF (0B)
  • ● Revision 0 　　
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags
Add yours

Related Papers

Statistics
PDF Downloaded 602
Bookmarked 0
Recommend 5
Comments Array
Submit your papers