Comprehensive Analysis & Performance Comparison of Clustering Algorithms for Big Data

Anand Nayyar () and Vikram Puri ()

Review of Computer Engineering Research, 2017, vol. 4, issue 2, 54-80

Abstract: 21st Century has marked high velocity of data generation not only in terms of size but also in variety. Analyzing large data sets with different forms is also a challenging task. Data Mining is regarded as efficient method to extract meaningful information as per user requirements. But considering the size of modern data, traditional data mining techniques are failing. Clustering can be regarded as one of the most important technique to mine the data by splitting large data sets into clusters. The paper’s primary contribution is to provide comprehensive analysis of Big Data Clustering algorithms on basis of: Partitioning, Hierarchical, Density, Grid and Model. In addition to this, performance comparison of algorithms is performed on basis of volume, variety and velocity.

Keywords: Big data; Clustering; Clustering algorithms; Partitioning-based clustering; Grid-based clustering; Hierarchical clustering; Density-based clustering; Model based clustering; Data mining (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://archive.conscientiabeam.com/index.php/76/article/view/1454/2034 (application/pdf)
https://archive.conscientiabeam.com/index.php/76/article/view/1454/4765 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pkp:rocere:v:4:y:2017:i:2:p:54-80:id:1454

Access Statistics for this article

More articles in Review of Computer Engineering Research from Conscientia Beam
Bibliographic data for series maintained by Dim Michael ().