Search

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 1 ) of 94.15%. This demonstrates how the proposed IPO approach can help to classify BCs effectively. The open-source codes are available at https://www.mathworks.com/matlabcentral/fileexchange/169846-an-efficient-improved-parrot-optimizer., Competing Interests: Declaration of competing interest The authors have declared that there are no conflicts of interest., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Emotion recognition based on Electroencephalography (EEG) signals has garnered significant attention across diverse domains including healthcare, education, information sharing, and gaming, among others. Despite its potential, the absence of a standardized feature set poses a challenge in efficiently classifying various emotions. Addressing the issue of high dimensionality, this paper introduces an advanced variant of the Coati Optimization Algorithm (COA), called eCOA for global optimization and selecting the best subset of EEG features for emotion recognition. Specifically, COA suffers from local optima and imbalanced exploitation abilities as other metaheuristic methods. The proposed eCOA incorporates the COA and RUNge Kutta Optimizer (RUN) algorithms. The Scale Factor (SF) and Enhanced Solution Quality (ESQ) mechanism from RUN are applied to resolve the raised shortcomings of COA. The proposed eCOA algorithm has been extensively evaluated using the CEC'22 test suite and two EEG emotion recognition datasets, DEAP and DREAMER. Furthermore, the eCOA is applied for binary and multi-class classification of emotions in the dimensions of valence, arousal, and dominance using a multi-layer perceptron neural network (MLPNN). The experimental results revealed that the eCOA algorithm has more powerful search capabilities than the original COA and seven well-known counterpart methods related to statistical, convergence, and diversity measures. Furthermore, eCOA can efficiently support feature selection to find the best EEG features to maximize performance on four quadratic emotion classification problems compared to the methods of its counterparts. The suggested method obtains a classification accuracy of 85.17% and 95.21% in the binary classification of low and high arousal emotions in two public datasets: DEAP and DREAMER, respectively, which are 5.58% and 8.98% superior to existing approaches working on the same datasets for different subjects, respectively., Competing Interests: Declaration of competing interest No conflict of interest exists., (Copyright © 2024 Elsevier Ltd. All rights reserved.)

Breast cancer is the second leading cause of death in women; therefore, effective early detection of this cancer can reduce its mortality rate. Breast cancer detection and classification in the early phases of development may allow for optimal therapy. Convolutional neural networks (CNNs) have enhanced tumor detection and classification efficiency in medical imaging compared to traditional approaches. This paper proposes a novel classification model for breast cancer diagnosis based on a hybridized CNN and an improved optimization algorithm, along with transfer learning, to help radiologists detect abnormalities efficiently. The marine predators algorithm (MPA) is the optimization algorithm we used, and we improve it using the opposition-based learning strategy to cope with the implied weaknesses of the original MPA. The improved marine predators algorithm (IMPA) is used to find the best values for the hyperparameters of the CNN architecture. The proposed method uses a pretrained CNN model called ResNet50 (residual network). This model is hybridized with the IMPA algorithm, resulting in an architecture called IMPA-ResNet50. Our evaluation is performed on two mammographic datasets, the mammographic image analysis society (MIAS) and curated breast imaging subset of DDSM (CBIS-DDSM) datasets. The proposed model was compared with other state-of-the-art approaches. The obtained results showed that the proposed model outperforms the compared state-of-the-art approaches, which are beneficial to classification performance, achieving 98.32% accuracy, 98.56% sensitivity, and 98.68% specificity on the CBIS-DDSM dataset and 98.88% accuracy, 97.61% sensitivity, and 98.40% specificity on the MIAS dataset. To evaluate the performance of IMPA in finding the optimal values for the hyperparameters of ResNet50 architecture, it compared to four other optimization algorithms including gravitational search algorithm (GSA), Harris hawks optimization (HHO), whale optimization algorithm (WOA), and the original MPA algorithm. The counterparts algorithms are also hybrid with the ResNet50 architecture produce models named GSA-ResNet50, HHO-ResNet50, WOA-ResNet50, and MPA-ResNet50, respectively. The results indicated that the proposed IMPA-ResNet50 is achieved a better performance than other counterparts. [ABSTRACT FROM AUTHOR]

Coronavirus disease 2019 (COVID-19) is pervasive worldwide, posing a high risk to people's safety and health. Many algorithms were developed to identify COVID-19. One way of identifying COVID-19 is by computed tomography (CT) images. Some segmentation methods are proposed to extract regions of interest from COVID-19 CT images to improve the classification. In this paper, an efficient version of the recent manta ray foraging optimization (MRFO) algorithm is proposed based on the oppositionbased learning called the MRFO-OBL algorithm. The original MRFO algorithm can stagnate in local optima and requires further exploration with adequate exploitation. Thus, to improve the population variety in the search space, we applied Opposition-based learning (OBL) in the MRFO's initialization step. MRFO-OBL algorithm can solve the image segmentation problem using multilevel thresholding. The proposed MRFO-OBL is evaluated using Otsu's method over the COVID-19 CT images and compared with six meta-heuristic algorithms: sine-cosine algorithm, moth flame optimization, equilibrium optimization, whale optimization algorithm, slap swarm algorithm, and original MRFO algorithm. MRFO-OBL obtained useful and accurate results in quality, consistency, and evaluation matrices, such as peak signal-to-noise ratio and structural similarity index. Eventually, MRFO-OBL obtained more robustness for the segmentation than all other algorithms compared. The experimental results demonstrate that the proposed method outperforms the original MRFO and the other compared algorithms under Otsu's method for all the used metrics. [ABSTRACT FROM AUTHOR]