Improved salp swarm algorithm-driven deep CNN for brain tumor analysis

• Published in: Scientific reports Vol. 15; no. 1; pp. 24645 - 23
• Main Authors: Agrawal, Umang Kumar, Panda, Nibedan, Tejani, Ghanshyam G., Mousavirad, Seyed Jalaleddin
• Format: Journal Article
• Language: English
• Published: London Nature Publishing Group UK 09.07.2025; Nature Portfolio
• Subjects: 639/705/1042; 639/705/117; Algorithms; Brain MRI; Brain Neoplasms - diagnostic imaging; CNN; Deep Learning; Humanities and Social Sciences; Humans; Local search; Magnetic Resonance Imaging - methods; Medical imaging; multidisciplinary; Neural Networks, Computer; Prognosis; Science; Science (multidisciplinary); SSA; SSA; Local search; CNN; Medical imaging; Prognosis; Brain MRI
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-025-09326-y

The efficiency of the swarm-based approach depends on the perfect balance of operators: exploration and exploitation. Due to a lack of balance between these two factors, the Salp Swarm Algorithm (SSA), a recently developed swarm-based metaheuristic approach, suffers from confined minima, stuck and untimely premature convergence. This paper introduces a new, improvised hybrid SSA named Local Search SSA (LS-SSA) to address the pitfalls associated with standard SSA. To prove the competency of the suggested LS-SSA, it is assessed over the twenty-eight functions suite of IEEE-CEC-2017 relating to a diverse set of contemporary methods. Furthermore, a sequence of non-parametric assessments was conducted to establish the statistical significance of the proposed LS-SSA. As a weak exploitation strength for neighbor exploration, SSA may result in less refined parameter tuning of CNN for healthcare-based medical imaging. Hence, LS-SSA is an effective algorithm for hyperparameter tuning of CNNs evaluated on medical imaging datasets, specifically brain MRI. This leads to improved model performance, characterized by higher accuracy, reduced standard deviation, lower minimum RMSE values, and higher average performance. Consequently, optimal candidate solutions with improved and faster convergence toward global optima are achieved.