Scalable Clustering Algorithms for Big data: A Review

Faculty Computer Science Year: 2021
Type of Publication: ZU Hosted Pages: 80015 - 80027
Authors:
Journal: IEEE Access IEEE Volume:
Keywords : Scalable Clustering Algorithms , , data: , Review    
Abstract:
Clustering algorithms have become one of the most critical research areas in multiple domains, especially data mining. However, with the massive growth of big data applications in the cloud world, these applications face many challenges and difficulties. Since Big Data refers to an enormous amount of data, most traditional clustering algorithms come with high computational costs. Hence, the research question is how to handle this volume of data and get accurate results at a critical time. Despite ongoing research work to develop different algorithms to facilitate complex clustering processes, there are still many difficulties that arise while dealing with a large volume of data. In this paper, we review the most relevant clustering algorithms in a categorized manner, provide a comparison of clustering methods for large-scale data and explain the overall challenges based on clustering type. The key idea of the paper is to highlight the main advantages and disadvantages of clustering algorithms for dealing with big data in a scalable approach behind the different other features.
   
     
 
       

Author Related Publications

  • Ibrahiem Mahmoud Mohamed Elhenawy, "BERT-CNN: A Deep Learning Model for Detecting Emotions from Text", Tech Science Press, 2021 More
  • Ibrahiem Mahmoud Mohamed Elhenawy, "Determining Extractive Summary for a Single Document Based on Collaborative Filtering Frequency Prediction and Mean Shift Clustering", International Association of Engineers, 2019 More
  • Ibrahiem Mahmoud Mohamed Elhenawy, "A Review on the Applications of Neutrosophic Sets", Source: Journal of Computational and Theoretical Nanoscience, Volume 13, Number 1, January 2016, pp. 936-944(9), 2016 More
  • Ibrahiem Mahmoud Mohamed Elhenawy, "Feature and Intensity Based Medical Image Registration Using Particle Swarm Optimization", Springer, 2017 More
  • Ibrahiem Mahmoud Mohamed Elhenawy, "Solving 0–1 knapsack problem by binary flower pollination algorithm", Springer, 2018 More

Department Related Publications

  • Ibrahiem Mahmoud Mohamed Elhenawy, "BERT-CNN: A Deep Learning Model for Detecting Emotions from Text", Tech Science Press, 2021 More
  • Ahmed Raafat Abass Mohamed Saliem, "BERT-CNN: A Deep Learning Model for Detecting Emotions from Text", Tech Science Press, 2021 More
  • Ahmed Raafat Abass Mohamed Saliem, "Using General Regression with Local Tuning for Learning Mixture Models from Incomplete Data Sets", ScienceDirect, 2010 More
  • Ahmed Raafat Abass Mohamed Saliem, "On determining efficient finite mixture models with compact and essential components for clustering data", ScienceDirect, 2013 More
  • Ahmed Raafat Abass Mohamed Saliem, "Unsupervised learning of mixture models based on swarm intelligence and neural networks with optimal completion using incomplete data", ScienceDirect, 2012 More
Tweet