article

A Survey on Efficient Big Data Clustering using MapReduce

  • CiiT international journal of data mining and knowledge engineering
Research footprint

At a glance

Citations
4
References
0
Comments
0
Paper overview

Abstract

Clustering analysis is key point used by data processing algorithms in Data Mining. The primary aim of Clustering is to segment the data into more diminutive subsets called clusters, such that the data belonging to the same cluster are similar with some similarity metric. Clustering is imperative idea in data investigation and data mining applications. Over years, K-means has been popular clustering algorithm because of its ease of use and simplicity. Now days, as data size is continuously increasing, some researchers started working over distributed environment such as MapReduce to get high performance for big data clustering. In this paper, we explore the current works on efficient big data clustering algorithm using MapReduce framework.

Record transparency

Publication details

OpenAlex
W2198199146
Document type
article
Language
EN
Source
CiiT international journal of data mining and knowledge engineering
Last metadata update
Community

Comments

Log in to join the discussion.

  1. No comments yet. Start the discussion.