An efficient improved parrot optimizer for bladder cancer classification.

Bladder Cancer (BC) is a common disease that comes with a high risk of morbidity, death, and expense. Primary risk factors for BC include exposure to carcinogens in the workplace or the environment, particularly tobacco. There are several difficulties, such as the requirement for a qualified expert in BC classification. The Parrot Optimizer (PO), is an optimization method inspired by key behaviors observed in trained Pyrrhura Molinae parrots, but the PO algorithm becomes stuck in sub-regions, has less accuracy, and a high error rate. So, an Improved variant of the PO (IPO) algorithm was developed using a combination of two strategies: (1) Mirror Reflection Learning (MRL) and (2) Bernoulli Maps (BMs). Both strategies improve optimization performance by avoiding local optimums and striking a compromise between convergence speed and solution diversity. The performance of the proposed IPO is evaluated against eight other competitor algorithms in terms of statistical convergence and other metrics according to Friedman's test and Bonferroni-Dunn test on the IEEE Congress on Evolutionary Computation conducted in 2022 (CEC 2022) test suite functions and nine BC datasets from official repositories. The IPO algorithm ranked number one in best fitness and is more optimal than the other eight MH algorithms for CEC 2022 functions. The proposed IPO algorithm was integrated with the Support Vector Machine (SVM) classifier termed (IPO-SVM) approach for bladder cancer classification purposes. Nine BC datasets were then used to confirm the effectiveness of the proposed IPO algorithm. The experiments show that the IPO-SVM approach outperforms eight recently proposed MH algorithms. Using the nine BC datasets, IPO-SVM achieved an Accuracy (ACC) of 84.11%, Sensitivity (SE) of 98.10%, Precision (PPV) of 95.59%, Specificity (SP) of 95.98%, and F-score (F

Informations de copyright

Copyright © 2024 Elsevier Ltd. All rights reserved.

Déclaration de conflit d'intérêts

Declaration of competing interest The authors have declared that there are no conflicts of interest.