A Review of Clustering Algorithms for Big Data

Big data is usually defined by five (05) characteristics called 5Vs +1C (Volume, Velocity, Variety, Veracity, Value and Complexity). It means to data that are too large, dynamic and complex with certain degree of accuracy. For that, data become difficult to analyze using traditional data analysis techniques because of their high complexity and computational cost. Clustering analysis technique is the most used method for cope with huge amount of data. The main goal of clustering is to classify data into clusters in manner that data grouped are more similar. In this paper, we provide an overview of various clustering techniques used for data analysis.

Paper

Full text

PDF

A Review of Clustering Algorithms for Big Data

Semantic Scholar · Computer Science · 2019

Abstract

Big data is usually defined by five (05) characteristics called 5Vs +1C (Volume, Velocity, Variety, Veracity, Value and Complexity). It means to data that are too large, dynamic and complex with certain degree of accuracy. For that, data become difficult to analyze using traditional data analysis techniques because of their high complexity and computational cost. Clustering analysis technique is the most used method for cope with huge amount of data. The main goal of clustering is to classify data into clusters in manner that data grouped are more similar. In this paper, we provide an overview of various clustering techniques used for data analysis.

Similar papers

© 2026 NYSGPT2525 LLC