Search

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. [ABSTRACT FROM AUTHOR]

In this article, quantum inspired incarnations of two swarm based meta‐heuristic algorithms, namely, Crow Search Optimization Algorithm and Intelligent Crow Search Optimization Algorithm have been proposed for automatic clustering of colour images. The performance and effectiveness of the proposed algorithms have been judged by experimenting on 15 Berkeley images and five publicly available real life images of different sizes. The validity of the proposed algorithms has been justified with the help of four different cluster validity indices, namely, Pakhira Bandyopadhyay Maulik, I‐index, Silhouette and CS‐measure. Moreover, Sobol's sensitivity analysis has been performed to tune the parameters of the proposed algorithms. The experimental results prove the superiority of proposed algorithms with respect to optimal fitness, computational time, convergence rate, accuracy, robustness, t‐test and Friedman test. Finally, the efficacy of the proposed algorithms has been proved with the help of quantitative evaluation of segmentation evaluation metrics. [ABSTRACT FROM AUTHOR]