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

  • Khalied Mohamed Hosny, "SEMANTIC REPRESENTATION OF MUSIC DATABASE USING NEW ONTOLOGY-BASED SYSTEM", Journal of Theoretical and Applied Information Technology, 2020 More
  • Khalied Mohamed Hosny, "Building a New Semantic Social Network Using Semantic Web-Based Techniques", ِASPG, 2021 More
  • Khalied Mohamed Hosny, "New Graphical Ultimate Processor for Mapping Relational Database to Resource Description Framework", IEEE, 2022 More
  • Khalied Mohamed Hosny, "Fast computation of accurate Zernike moments", Springer, 2008 More
  • Khalied Mohamed Hosny, "Accurate Computation of QPCET for Color Images in Different Coordinate Systems", SPIE, 2017 More

Department Related Publications

  • Ahmed Salah Mohamed Mostafa, "Lazy-Merge: A Novel Implementation for Indexed Parallel K-Way In-Place Merging", IEEE, 2016 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
  • Doaa El-Shahat Barakat Mohammed, "A modified nature inspired meta-heuristic whale optimization algorithm for solving 0–1 knapsack problem", Springer Berlin Heidelberg, 2017 More
  • Ibrahiem Mahmoud Mohamed Elhenawy, "A novel whale optimization algorithm for cryptanalysis in Merkle-Hellman cryptosystem", Springer US, 2018 More
  • Abdallah Gamal abdallah mahmoud, "A Bipolar Neutrosophic Multi Criteria Decision Making Framework for Professional Selection", MDPI, 2020 More
Tweet