EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering

Alokananda Dey, Siddhartha Bhattacharyya, Sandip Dey, Debanjan Konar, Jan Platos, Vaclav Snasel, Leo Mrsic, Pankaj Pal

Mathematics · 24.04.2023 · 11 (9) · 2018

DOI: 10.3390/math11092018 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 24.04.2023. Verfasst von Alokananda Dey und 7 weiteren Autor:innen. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 284 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In real-world scenarios, identifying the optimal number of clusters in a dataset is a difficult task due to insufficient knowledge. Therefore, the indispensability of sophisticated automatic clustering algorithms for this purpose has been contemplated by some researchers. Several automatic clustering algorithms assisted by quantum-inspired metaheuristics have been developed in recent years. However, the literature lacks definitive documentation of the state-of-the-art quantum-inspired metaheuristic algorithms for automatically clustering datasets. This article presents a brief overview of the automatic clustering process to establish the importance of making the clustering process automatic. The fundamental concepts of the quantum computing paradigm are also presented to highlight the utility of quantum-inspired algorithms. This article thoroughly analyses some algorithms employed to address the automatic clustering of various datasets. The reviewed algorithms were classified according to their main sources of inspiration. In addition, some representative works of each classification were chosen from the existing works. Thirty-six such prominent algorithms were further critically analysed based on their aims, used mechanisms, data specifications, merits and demerits. Comparative results based on the performance and optimal computational time are also presented to critically analyse the reviewed algorithms. As such, this article promises to provide a detailed analysis of the state-of-the-art quantum-inspired metaheuristic algorithms, while highlighting their merits and demerits.

Zitieren

APA

Dey, A., Bhattacharyya, S., Dey, S., Konar, D., Platos, J., Snasel, V., Mrsic, L., & Pal, P. (2023). A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering. Mathematics, 11(9), 2018. https://doi.org/10.3390/math11092018

Vancouver

Dey A, Bhattacharyya S, Dey S, Konar D, Platos J, Snasel V, et al. A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering. Mathematics. 2023;11(9):2018. doi:10.3390/math11092018

BibTeX
@article{Dey2023,
  author = {Dey, Alokananda and Bhattacharyya, Siddhartha and Dey, Sandip and Konar, Debanjan and Platos, Jan and Snasel, Vaclav and Mrsic, Leo and Pal, Pankaj},
  title = {A Review of Quantum-Inspired Metaheuristic Algorithms for Automatic Clustering},
  journal = {Mathematics},
  year = {2023},
  volume = {11},
  number = {9},
  pages = {2018},
  doi = {10.3390/math11092018}
}
Kostenlos starten →