In:
Software: Practice and Experience, Wiley, Vol. 46, No. 1 ( 2016-01), p. 107-129
Abstract:
Enterprises today are dealing with the massive size of data, which have been explosively increasing. The key requirements to address this challenge are to extract, analyze, and process data in a timely manner. Clustering is an essential data mining tool that plays an important role for analyzing big data. However, large‐scale data clustering has become a challenging task because of the large amount of information that emerges from technological progress in many areas, including finance and business informatics. Accordingly, researchers have dealt with parallel clustering algorithms using parallel programming models to address this issue. MapReduce is one of the most famous frameworks, and it has attracted great attention because of its flexibility, ease of programming, and fault tolerance. However, the framework has evident performance limitations, especially for iterative programs. This study will first review the proposed iterative frameworks that extended MapReduce to support iterative algorithms. We summarize these techniques, discuss their uniqueness and limitations, and explain how they address the challenging issues of iterative programs. We also perform an in‐depth review to understand the problems and the solving techniques for parallel clustering algorithms. Hence, we believe that no well‐rounded review provides a significant comparison among parallel clustering algorithms using MapReduce. This work aims to serve as a stepping stone for researchers who are studying big data clustering algorithms. Copyright © 2015 John Wiley & Sons, Ltd.
Type of Medium:
Online Resource
ISSN:
0038-0644
,
1097-024X
Language:
English
Publisher:
Wiley
Publication Date:
2016
detail.hit.zdb_id:
120252-2
detail.hit.zdb_id:
1500326-7
Permalink
