A Comprehensive Analysis of Kernelized Hybrid Clustering Algorithms with Firefly and Fuzzy Firefly Algorithms

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to handle the problem of linear separability in the early data clustering algorithms, Euclidean distance is being replaced with Kernel functions as measures of similarity. Another problem with the clustering algorithms is the selection of initial centroids randomly, which affects not only the final result but also decreases the convergence rate. Optimal selection of initial centroids through optimization algorithms like Firefly or Fuzzy Firefly algorithms provide partial solution to this problem. In this paper, we focus on two kernels; Gaussian and Hyper-tangent and use both Firefly and Fuzzy Firefly algorithms separately along with algorithms like FCM, IFCM and RFCM and analyse their efficiency using two measures DB and D. Our analysis concludes that RFCM with Hyper-tangent kernel and fuzzy firefly produce the best results with fastest convergence rate. We use the two images; MRI scan of a human brain and blood cancer cells for our analysis.

Cite

CITATION STYLE

APA

Tripathy, B. K., & Agrawal, A. (2020). A Comprehensive Analysis of Kernelized Hybrid Clustering Algorithms with Firefly and Fuzzy Firefly Algorithms. In Advances in Intelligent Systems and Computing (Vol. 990, pp. 351–365). Springer. https://doi.org/10.1007/978-981-13-8676-3_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free