Applying the K-Means Algorithm in Big Raw Data Sets with Hadoop and MapReduce

Applying the K-Means Algorithm in Big Raw Data Sets with Hadoop and MapReduce

Author: 
Savvas, Ilias K.
Place: 
Hershey
Publisher: 
IGI Global
Date published: 
2013
Responsibility: 
Sofianidou, Georgia N., jt.author
Kechadi, M-Tahar, jt.author
Editor: 
Hu, Wen-Chen
Journal Title: 
Big Data Management, Technologies, and Applications
Source: 
Big Data Management, Technologies, and Applications
Subject: 
Abstract: 

Big data refers to data sets whose size is beyond the capabilities of most current hardware and software technologies. The Apache Hadoop software library is a framework for distributed processing of large data sets, while HDFS is a distributed file system that provides high-throughput access to data-driven applications, and MapReduce is software framework for distributed computing of large data sets. Huge collections of raw data require fast and accurate mining processes in order to extract useful knowledge. One of the most popular techniques of data mining is the K-means clustering algorithm. In this study, the authors develop a distributed version of the K-means algorithm using the MapReduce framework on the Hadoop Distributed File System. The theoretical and experimental results of the technique prove its efficiency; thus, HDFS and MapReduce can apply to big data with very promising results.

Series: 
Advances in Data Mining and Database Management

CITATION: Savvas, Ilias K.. Applying the K-Means Algorithm in Big Raw Data Sets with Hadoop and MapReduce edited by Hu, Wen-Chen . Hershey : IGI Global , 2013. Big Data Management, Technologies, and Applications - Available at: https://library.au.int/frapplying-k-means-algorithm-big-raw-data-sets-hadoop-and-mapreduce