A Comparative Performance Study of Hybrid Firefly Algorithms for Automatic Data Clustering

Faculty Science Year: 2020
Type of Publication: ZU Hosted Pages:
Authors:
Journal: IEEE Access IEEE Volume:
Keywords : , Comparative Performance Study , Hybrid Firefly Algorithms    
Abstract:
In cluster analysis, the goal has always been to extemporize the best possible means of automatically determining the number of clusters. However, because of lack of prior domain knowledge and uncertainty associated with data objects characteristics, it is challenging to choose an appropriate number of clusters, especially when dealing with data objects of high dimensions, varying data sizes, and density. In the last few decades, different researchers have proposed and developed several nature-inspired metaheuristic algorithms to solve data clustering problems. Many studies have shown that the firefly algorithm is a very robust, efficient and effective nature-inspired swarm intelligence global search technique, which has been successfully applied to solve diverse NP-hard optimization problems. However, the diversification search process employed by the firefly algorithm can lead to reduced speed and convergence rate for large-scale optimization problems. Thus this study investigates the application of four hybrid firefly algorithms to the task of automatic clustering of high density and large-scaled unlabelled datasets. In contrast to most of the existing classical heuristic-based data clustering analyses techniques, the proposed hybrid algorithms do not require any prior knowledge of the data objects to be classified. Instead, the hybrid methods automatically determine the optimal number of clusters empirically and during the program execution. Two well-known clustering validity indices, namely the Compact-Separated and Davis-Bouldin indices, are employed to evaluate the superiority of the implemented firefly hybrid algorithms. Furthermore, twelve standard ground truth clustering datasets from the UCI Machine Learning Repository are used to evaluate the robustness and effectiveness of the algorithms against those of the classical swarm optimization algorithms and other related clustering results from the literature. The experimental results show that the new clustering methods depict high superiority in comparison with existing standalone and other hybrid metaheuristic techniques in terms of clustering validity measures.
   
     
 
       

Author Related Publications

  • Mohamed El Sayed Ahmed Muhamed, "A Grunwald–Letnikov based Manta ray foraging optimizer for global optimization and image segmentation", Elsevier, 2020 More
  • Mohamed El Sayed Ahmed Muhamed, "A novel hybrid gradient-based optimizer and grey wolf optimizer feature selection method for human activity recognition using smartphone sensors", MDPI, 2021 More
  • Mohamed El Sayed Ahmed Muhamed, "Efficient schemes for playout latency reduction in P2P-VOD systems", Springer, 2018 More
  • Mohamed El Sayed Ahmed Muhamed, "a novel algorithm for source localization based on nonnegative matrix factroization using \alpha 'beta divergence in chochleagram", WSEAS, 2013 More
  • Mohamed El Sayed Ahmed Muhamed, "Open cluster membership probability based on K-means clustering algorithm", Springer, 2016 More

Department Related Publications

  • Rodyna Ahmed Mahmoud, "Pre-Open Sets with Ideal", Scientific Research Platform (SRP), 2013 More
  • Rodyna Ahmed Mahmoud, "ON BCL-ALGEBRA", Council for Innovative Research, 2013 More
  • Yasser AbdelAziz Amer Tolba, "The improved (G’/G) - expansion method for constructing exact traveling wave solutions for a nonlinear PDE of nanobiosciences", USA, 2013 More
  • Alaa Hassan Attia Hassan, "A Unified Representation of Some Starlike and Convex Harmonic Functions with Negative Coefficients", AGH University of Science and Technology Press, Krakow 2013, Poland, 2013 More
  • Alaa Hassan Attia Hassan, "Generalizations of Hadamard Procuct of Certain Meromorphic Multivalent Functions with Positive Coefficients", Istanbul Universitesi, Turkey, 2013 More
Tweet