Hybridization of K-means with improved firefly algorithm for automatic clustering in high dimension

Afroj Alam
2/9/2023
cs.LG

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

K-means Clustering is the most well-known partitioning algorithm among all clustering, by which we can partition the data objects very easily in to more than one clusters. However, for K-means to choose an appropriate number of clusters without any prior domain knowledge about the dataset is challenging, especially in high-dimensional data objects. Hence, we have implemented the Silhouette and Elbow methods with PCA to find an optimal number of clusters. Also, previously, so many meta-heuristic swarm intelligence algorithms inspired by nature have been employed to handle the automatic data clustering problem. Firefly is efficient and robust for automatic clustering. However, in the Firefly algorithm, the entire population is automatically subdivided into sub-populations that decrease the convergence rate speed and trapping to local minima in high-dimensional optimization problems. Thus, our study proposed an enhanced firefly, i.e., a hybridized K-means with an ODFA model for automatic clustering. The experimental part shows output and graphs of the Silhouette and Elbow methods as well as the Firefly algorithm

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{alam2023hybridization,
  title  = {Hybridization of K-means with improved firefly algorithm for automatic clustering in high dimension},
  author = {Afroj Alam},
  year   = {2023},
  eprint = {2302.10765},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.10765v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.10765.svg)](https://codeofpaper.com/paper/2302.10765)

Discussion