Improved deep convolutional neural networks using chimp optimization algorithm for Covid19 diagnosis from the X-ray images

The explainable potential of coupling hybridized metaheuristics, XGBoost, and SHAP in revealing toluene behavior in the atmosphere

Toluene is a neurotoxic aromatic hydrocarbon and one of the major representatives of volatile organic compounds, known for its abundance, adverse health effects, and role in the formation of other atmospheric pollutants like ozone. This research introduces the enhanced version of the reptile search metaheuristics algorithm which has been utilized to tune the extreme gradient boosting hyperparameters, to investigate toluene atmospheric behavior patterns and interactions with other polluting species within defined environmental conditions. The study is based on a two-year database encompassing concentrations of inorganic gaseous contaminants every hour (NO, NO2, NOx, and O3), particulate matter fractions (PM1, PM2.5, and PM10), m,p-xylene, toluene, benzene, total non-methane hydrocarbons, and meteorological data. The experimental outcomes were validated against the results of extreme gradient boosting models optimized by seven other recent powerful metaheuristics algorithms. The best-performing model has been interpreted by employing Shapley additive explanations method. In the study, we have focused on the relationship between toluene and benzene, as its most important predictor, and provided a detailed description of environmental conditions which directed their interactions.

An improved manta ray foraging optimization algorithm

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms.

Sand cat swarm optimization algorithm and its application integrating elite decentralization and crossbar strategy

Sand cat swarm optimization algorithm is a meta-heuristic algorithm created to replicate the hunting behavior observed by sand cats. The presented sand cat swarm optimization method (CWXSCSO) addresses the issues of low convergence precision and local optimality in the standard sand cat swarm optimization algorithm. It accomplished this through the utilization of elite decentralization and a crossbar approach. To begin with, a novel dynamic exponential factor is introduced. Furthermore, throughout the developmental phase, the approach of elite decentralization is incorporated to augment the capacity to transcend the confines of the local optimal. Ultimately, the crossover technique is employed to produce novel solutions and augment the algorithm's capacity to emerge from local space. The techniques were evaluated by performing a comparison with 15 benchmark functions. The CWXSCSO algorithm was compared with six advanced upgraded algorithms using CEC2019 and CEC2021. Statistical analysis, convergence analysis, and complexity analysis use statistics for assessing it. The CWXSCSO is employed to verify its efficacy in solving engineering difficulties by handling six traditional engineering optimization problems. The results demonstrate that the upgraded sand cat swarm optimization algorithm exhibits higher global optimization capability and demonstrates proficiency in dealing with real-world optimization applications.

FUZ-SMO: A fuzzy slime mould optimizer for mitigating false alarm rates in the classification of underwater datasets using deep convolutional neural networks

Sonar sound datasets are of significant importance in the domains of underwater surveillance and marine research as they enable experts to discern intricate patterns within the depths of the water. Nevertheless, the task of classifying sonar sound datasets continues to pose significant challenges. In this study, we present a novel approach aimed at enhancing the precision and efficacy of sonar sound dataset classification. The integration of deep long-short-term memory (DLSTM) and convolutional neural networks (CNNs) models is employed in order to capitalize on their respective advantages while also utilizing distinctive feature engineering techniques to achieve the most favorable outcomes. Although DLSTM networks have demonstrated effectiveness in tasks involving sequence classification, attaining their optimal performance necessitates careful adjustment of hyperparameters. While traditional methods such as grid and random search are effective, they frequently encounter challenges related to computational inefficiencies. This study aims to investigate the unexplored capabilities of the fuzzy slime mould optimizer (FUZ-SMO) in the context of LSTM hyperparameter tuning, with the objective of addressing the existing research gap in this area. Drawing inspiration from the adaptive behavior exhibited by slime moulds, the FUZ-SMO proposes a novel approach to optimization. The amalgamated model, which combines CNN, LSTM, fuzzy, and SMO, exhibits a notable improvement in classification accuracy, outperforming conventional LSTM architectures by a margin of 2.142%. This model not only demonstrates accelerated convergence milestones but also displays significant resilience against overfitting tendencies.

AttGRU-HMSI: enhancing heart disease diagnosis using hybrid deep learning approach

Heart disease is a major global cause of mortality and a major public health problem for a large number of individuals. A major issue raised by regular clinical data analysis is the recognition of cardiovascular illnesses, including heart attacks and coronary artery disease, even though early identification of heart disease can save many lives. Accurate forecasting and decision assistance may be achieved in an effective manner with machine learning (ML). Big Data, or the vast amounts of data generated by the health sector, may assist models used to make diagnostic choices by revealing hidden information or intricate patterns. This paper uses a hybrid deep learning algorithm to describe a large data analysis and visualization approach for heart disease detection. The proposed approach is intended for use with big data systems, such as Apache Hadoop. An extensive medical data collection is first subjected to an improved k-means clustering (IKC) method to remove outliers, and the remaining class distribution is then balanced using the synthetic minority over-sampling technique (SMOTE). The next step is to forecast the disease using a bio-inspired hybrid mutation-based swarm intelligence (HMSI) with an attention-based gated recurrent unit network (AttGRU) model after recursive feature elimination (RFE) has determined which features are most important. In our implementation, we compare four machine learning algorithms: SAE + ANN (sparse autoencoder + artificial neural network), LR (logistic regression), KNN (K-nearest neighbour), and naïve Bayes. The experiment results indicate that a 95.42% accuracy rate for the hybrid model's suggested heart disease prediction is attained, which effectively outperforms and overcomes the prescribed research gap in mentioned related work.

A novel mixed frequency sampling discrete grey model for forecasting hard disk drive failure

The mixed data sampling (MIDAS) model has attracted increasing attention due to its outstanding performance in dealing with mixed frequency data. However, most MIDAS model extension studies are based on statistical methods or machine learning models, which suffer from insufficient prediction performance and stability in small sample environments. To solve this problem, this paper proposes a novel mixed frequency sampling discrete grey model (MDGM(1, N)), which is a coupled form of the MIDAS model and discrete grey multivariate model. By adjusting the structure parameters, the model can be adapted to different sampling frequencies data, and degenerate into several types of grey models. Then, the unbiasedness and stability of the model are proved using the mathematical analysis method and numerical random experiment. The meta-heuristic algorithm is introduced to obtain the optimal weight parameters and the maximum lag order, improving the model's fitting ability to mixed frequency data. To demonstrate the effectiveness of the new model, a model evaluation system consisting of traditional evaluation metrics and a monotonicity test is established. Taking four hard disk drive failure datasets as research cases, the performance of the proposed model is compared with seven mainstream benchmark models. The results show that the proposed model has excellent applicability and outperforms other competition models in terms of validity, stability, and robustness. Furthermore, it is observed that the reported uncorrectable errors and the command timeout have a greater impact on hard disk drive failure. Finally, the new model is employed to forecast the failure of four hard disk drives. The forecasting results indicate that in the next four time points with a cycle of 21 days beginning in April 2023, the failure of the smaller capacity hard disk drives (0055 and 0086, corresponding to 8TB and 10TB) show a decreasing trend, reaching 67.442% and 89.7683%, respectively. The failure of the other larger capacity hard disk drives (0007 and 0138, corresponding to 12TB and 14TB) has increased, with a growth rate of 17.1016% and 123.7899%.

Enhanced chimp hierarchy optimization algorithm with adaptive lens imaging for feature selection in data classification

Feature selection is a critical component of machine learning and data mining to remove redundant and irrelevant features from a dataset. The Chimp Optimization Algorithm (CHoA) is widely applicable to various optimization problems due to its low number of parameters and fast convergence rate. However, CHoA has a weak exploration capability and tends to fall into local optimal solutions in solving the feature selection process, leading to ineffective removal of irrelevant and redundant features. To solve this problem, this paper proposes the Enhanced Chimp Hierarchy Optimization Algorithm for adaptive lens imaging (ALI-CHoASH) for searching the optimal classification problems for the optimal subset of features. Specifically, to enhance the exploration and exploitation capability of CHoA, we designed a chimp social hierarchy. We employed a novel social class factor to label the class situation of each chimp, enabling effective modelling and optimization of the relationships among chimp individuals. Then, to parse chimps' social and collaborative behaviours with different social classes, we introduce other attacking prey and autonomous search strategies to help chimp individuals approach the optimal solution faster. In addition, considering the poor diversity of chimp groups in the late iteration, we propose an adaptive lens imaging back-learning strategy to avoid the algorithm falling into a local optimum. Finally, we validate the improvement of ALI-CHoASH in exploration and exploitation capabilities using several high-dimensional datasets. We also compare ALI-CHoASH with eight state-of-the-art methods in classification accuracy, feature subset size, and computation time to demonstrate its superiority.

Multi-objective liver cancer algorithm: A novel algorithm for solving engineering design problems

This research introduces the Multi-Objective Liver Cancer Algorithm (MOLCA), a novel approach inspired by the growth and proliferation patterns of liver tumors. MOLCA emulates the evolutionary tendencies of liver tumors, leveraging their expansion dynamics as a model for solving multi-objective optimization problems in engineering design. The algorithm uniquely combines genetic operators with the Random Opposition-Based Learning (ROBL) strategy, optimizing both local and global search capabilities. Further enhancement is achieved through the integration of elitist non-dominated sorting (NDS), information feedback mechanism (IFM) and Crowding Distance (CD) selection method, which collectively aim to efficiently identify the Pareto optimal front. The performance of MOLCA is rigorously assessed using a comprehensive set of standard multi-objective test benchmarks, including ZDT, DTLZ and various Constraint (CONSTR, TNK, SRN, BNH, OSY and KITA) and real-world engineering design problems like Brushless DC wheel motor, Safety isolating transformer, Helical spring, Two-bar truss and Welded beam. Its efficacy is benchmarked against prominent algorithms such as the non-dominated sorting grey wolf optimizer (NSGWO), multiobjective multi-verse optimization (MOMVO), non-dominated sorting genetic algorithm (NSGA-II), decomposition-based multiobjective evolutionary algorithm (MOEA/D) and multiobjective marine predator algorithm (MOMPA). Quantitative analysis is conducted using GD, IGD, SP, SD, HV and RT metrics to represent convergence and distribution, while qualitative aspects are presented through graphical representations of the Pareto fronts. The MOLCA source code is available at: https://github.com/kanak02/MOLCA.

A chimp algorithm based on the foraging strategy of manta rays and its application

To address the issue of poor performance in the chimp optimization (ChOA) algorithm, a new algorithm called the manta ray-based chimpa optimization algorithm (MChOA) was developed. Introducing the Latin hypercube method to construct the initial population so that the individuals of the initial population are evenly distributed in the solution space, increasing the diversity of the initial population. Introducing nonlinear convergence factors based on positive cut functions to changing the convergence of algorithms, the early survey capabilities and later development capabilities of the algorithm are balanced. The manta ray foraging strategy is introduced at the position update to make up for the defect that the algorithm is prone to local optimization, which effectively improves the optimization performance of the algorithm. To evaluate the performance of the proposed algorithm, 27 well-known test reference functions were selected for experimentation, which showed significant advantages compared to other algorithms. Finally, in order to further verify the algorithm's applicability in actual production processes, it was applied to solve scheduling problems in three flexible workshop scenarios and an aviation engine job shop scheduling in an enterprise. This confirmed its efficacy in addressing complex real-world problems.

Augmented weighted K-means grey wolf optimizer: An enhanced metaheuristic algorithm for data clustering problems

This study presents the K-means clustering-based grey wolf optimizer, a new algorithm intended to improve the optimization capabilities of the conventional grey wolf optimizer in order to address the problem of data clustering. The process that groups similar items within a dataset into non-overlapping groups. Grey wolf hunting behaviour served as the model for grey wolf optimizer, however, it frequently lacks the exploration and exploitation capabilities that are essential for efficient data clustering. This work mainly focuses on enhancing the grey wolf optimizer using a new weight factor and the K-means algorithm concepts in order to increase variety and avoid premature convergence. Using a partitional clustering-inspired fitness function, the K-means clustering-based grey wolf optimizer was extensively evaluated on ten numerical functions and multiple real-world datasets with varying levels of complexity and dimensionality. The methodology is based on incorporating the K-means algorithm concept for the purpose of refining initial solutions and adding a weight factor to increase the diversity of solutions during the optimization phase. The results show that the K-means clustering-based grey wolf optimizer performs much better than the standard grey wolf optimizer in discovering optimal clustering solutions, indicating a higher capacity for effective exploration and exploitation of the solution space. The study found that the K-means clustering-based grey wolf optimizer was able to produce high-quality cluster centres in fewer iterations, demonstrating its efficacy and efficiency on various datasets. Finally, the study demonstrates the robustness and dependability of the K-means clustering-based grey wolf optimizer in resolving data clustering issues, which represents a significant advancement over conventional techniques. In addition to addressing the shortcomings of the initial algorithm, the incorporation of K-means and the innovative weight factor into the grey wolf optimizer establishes a new standard for further study in metaheuristic clustering algorithms. The performance of the K-means clustering-based grey wolf optimizer is around 34% better than the original grey wolf optimizer algorithm for both numerical test problems and data clustering problems.

Early energy performance analysis of smart buildings by consolidated artificial neural network paradigms

The assessment of energy performance in smart buildings has emerged as a prominent area of research driven by the increasing energy consumption trends worldwide. Analyzing the attributes of buildings using optimized machine learning models has been a highly effective approach for estimating the cooling load (CL) and heating load (HL) of the buildings. In this study, an artificial neural network (ANN) is used as the basic predictor that undergoes optimization using five metaheuristic algorithms, namely coati optimization algorithm (COA), gazelle optimization algorithm (GOA), incomprehensible but intelligible-in-time logics (IbIL), osprey optimization algorithm (OOA), and sooty tern optimization algorithm (STOA) to predict the CL and HL of a residential building. The models are trained and tested via an Energy Efficiency dataset (downloaded from UCI Repository). A score-based ranking system is built upon three accuracy evaluators including mean absolute percentage error (MAPE), root mean square error (RMSE), and percentage-Pearson correlation coefficient (PPCC) to compare the prediction accuracy of the models. Referring to the results, all models demonstrated high accuracy (e.g., PPCCs >89%) for predicting both CL and HL. However, the calculated final scores of the models (43, 20, 39, 38, and 10 in HL prediction and 36, 20, 42, 42, and 10 in CL prediction for the STOA, OOA, IbIL, GOA, and COA, respectively) indicated that the GOA, IbIL, and STOA perform better than COA and OOA. Moreover, a comparison with various algorithms used in earlier literature showed that the GOA, IbIL, and STOA provide a more accurate solution. Therefore, the use of ANN optimized by these three algorithms is recommended for practical early forecast of energy performance in buildings and optimizing the design of energy systems.

Chaotic opposition learning with mirror reflection and worst individual disturbance grey wolf optimizer for continuous global numerical optimization

The effective meta-heuristic technique known as the grey wolf optimizer (GWO) has shown its proficiency. However, due to its reliance on the alpha wolf for guiding the position updates of search agents, the risk of being trapped in a local optimal solution is notable. Furthermore, during stagnation, the convergence of other search wolves towards this alpha wolf results in a lack of diversity within the population. Hence, this research introduces an enhanced version of the GWO algorithm designed to tackle numerical optimization challenges. The enhanced GWO incorporates innovative approaches such as Chaotic Opposition Learning (COL), Mirror Reflection Strategy (MRS), and Worst Individual Disturbance (WID), and it's called CMWGWO. MRS, in particular, empowers certain wolves to extend their exploration range, thus enhancing the global search capability. By employing COL, diversification is intensified, leading to reduced solution stagnation, improved search precision, and an overall boost in accuracy. The integration of WID fosters more effective information exchange between the least and most successful wolves, facilitating a successful exit from local optima and significantly enhancing exploration potential. To validate the superiority of CMWGWO, a comprehensive evaluation is conducted. A wide array of 23 benchmark functions, spanning dimensions from 30 to 500, ten CEC19 functions, and three engineering problems are used for experimentation. The empirical findings vividly demonstrate that CMWGWO surpasses the original GWO in terms of convergence accuracy and robust optimization capabilities.

Accurate multilevel thresholding image segmentation via oppositional Snake Optimization algorithm: Real cases with liver disease

Liver-related diseases significantly contribute to global mortality rates. Accurate segmentation of liver disease from CT scans is essential for early diagnosis and treatment selection, particularly in computer-aided diagnosis (CAD) systems. To address challenges posed by inconsistent liver presence and unclear boundaries, an enhanced Snake Optimization (SO) algorithm is proposed that integrates with opposition-based learning (OBL) called (SO-OBL), proving effective in global optimization and multilevel image segmentation. Experiments using CEC'2022 test functions compare SO-OBL with eleven recent and state-of-the-art metaheuristic algorithms, demonstrating its superior performance. Additionally, an advanced liver disease segmentation model based on SO-OBL incorporates an optimized multilevel thresholding technique, leveraging Otsu's function. Notable segmentation metric results, including FSIM = 0.947, SSIM = 0.941, PSNR = 24.876, MSE = 236.88, and execution time = 0.281, underscore the model's efficiency and potential for accurate diagnosis in CAD systems.

Brain tumor segmentation based on optimized convolutional neural network and improved chimp optimization algorithm

Reliable and accurate brain tumor segmentation is a challenging task even with the appropriate acquisition of brain images. Tumor grading and segmentation utilizing Magnetic Resonance Imaging (MRI) are necessary steps for correct diagnosis and treatment planning. There are different MRI sequence images (T1, Flair, T1ce, T2, etc.) for identifying different parts of the tumor. Due to the diversity in the illumination of each brain imaging modality, different information and details can be obtained from each input modality. Therefore, by using various MRI modalities, the diagnosis system is capable of finding more unique details that lead to a better segmentation result, especially in fuzzy borders. In this study, to achieve an automatic and robust brain tumor segmentation framework using four MRI sequence images, an optimized Convolutional Neural Network (CNN) is proposed. All weight and bias values of the CNN model are adjusted using an Improved Chimp Optimization Algorithm (IChOA). In the first step, all four input images are normalized to find some potential areas of the existing tumor. Next, by employing the IChOA, the best features are selected using a Support Vector Machine (SVM) classifier. Finally, the best-extracted features are fed to the optimized CNN model to classify each object for brain tumor segmentation. Accordingly, the proposed IChOA is utilized for feature selection and optimizing Hyperparameters in the CNN model. The experimental outcomes conducted on the BRATS 2018 dataset demonstrate superior performance (Precision of 97.41 %, Recall of 95.78 %, and Dice Score of 97.04 %) compared to the existing frameworks.

A new diagnostic autism spectrum disorder (DASD) strategy using ensemble diagnosis methodology based on blood tests

Autism Spectrum Disorder (ASD) is a complex neurodevelopmental disease that impacts a child's way of behavior and social communication. In early childhood, children with ASD typically exhibit symptoms such as difficulty in social interaction, limited interests, and repetitive behavior. Although there are symptoms of ASD disease, most people do not understand these symptoms and therefore do not have enough knowledge to determine whether or not a child has ASD. Thus, early detection of ASD children based on accurate diagnosis model based on Artificial Intelligence (AI) techniques is a critical process to reduce the spread of the disease and control it early. Through this paper, a new Diagnostic Autism Spectrum Disorder (DASD) strategy is presented to quickly and accurately detect ASD children. DASD contains two layers called Data Filter Layer (DFL) and Diagnostic Layer (DL). Feature selection and outlier rejection processes are performed in DFL to filter the ASD dataset from less important features and incorrect data before using the diagnostic or detection method in DL to accurately diagnose the patients. In DFL, Binary Gray Wolf Optimization (BGWO) technique is used to select the most significant set of features while Binary Genetic Algorithm (BGA) technique is used to eliminate invalid training data. Then, Ensemble Diagnosis Methodology (EDM) as a new diagnostic technique is used in DL to quickly and precisely diagnose ASD children. In this paper, the main contribution is EDM that consists of several diagnostic models including Enhanced K-Nearest Neighbors (EKNN) as one of them. EKNN represents a hybrid technique consisting of three methods called K-Nearest Neighbors (KNN), Naïve Bayes (NB), and Chimp Optimization Algorithm (COA). NB is used as a weighed method to convert data from feature space to weight space. Then, COA is used as a data generation method to reduce the size of training dataset. Finally, KNN is applied on the reduced data in weight space to quickly and accurately diagnose ASD children based on new training dataset with small size. ASD blood tests dataset is used to test the proposed DASD strategy against other recent strategies [1]. It is concluded that the DASD strategy is superior to other strategies based on many performance measures including accuracy, error, recall, precision, micro_average precision, macro_average precision, micro_average recall, macro_average recall, F1-measure, and implementation-time with values equal to 0.93, 0.07, 0.83, 0.82, 0.80, 0.83, 0.79, 0.81, 0.79, and 1.5 s respectively.

Development of a hybrid LSTM with chimp optimization algorithm for the pressure ventilator prediction

The utilization of mechanical ventilation is of utmost importance in the management of individuals afflicted with severe pulmonary conditions. During periods of a pandemic, it becomes imperative to build ventilators that possess the capability to autonomously adapt parameters over the course of treatment. In order to fulfil this requirement, a research investigation was undertaken with the aim of forecasting the magnitude of pressure applied on the patient by the ventilator. The aforementioned forecast was derived from a comprehensive analysis of many variables, including the ventilator's characteristics and the patient's medical state. This analysis was conducted utilizing a sophisticated computational model referred to as Long Short-Term Memory (LSTM). To enhance the predictive accuracy of the LSTM model, the researchers utilized the Chimp Optimization method (ChoA) method. The integration of LSTM and ChoA led to the development of the LSTM-ChoA model, which successfully tackled the issue of hyperparameter selection for the LSTM model. The experimental results revealed that the LSTM-ChoA model exhibited superior performance compared to alternative optimization algorithms, namely whale grey wolf optimizer (GWO), optimization algorithm (WOA), and particle swarm optimization (PSO). Additionally, the LSTM-ChoA model outperformed regression models, including K-nearest neighbor (KNN) Regressor, Random and Forest (RF) Regressor, and Support Vector Machine (SVM) Regressor, in accurately predicting ventilator pressure. The findings indicate that the suggested predictive model, LSTM-ChoA, demonstrates a reduced mean square error (MSE) value. Specifically, when comparing ChoA with GWO, the MSE fell by around 14.8%. Furthermore, when comparing ChoA with PSO and WOA, the MSE decreased by approximately 60%. Additionally, the analysis of variance (ANOVA) findings revealed that the p-value for the LSTM-ChoA model was 0.000, which is less than the predetermined significance level of 0.05. This indicates that the results of the LSTM-ChoA model are statistically significant.

Antenna S-parameter optimization based on golden sine mechanism based honey badger algorithm with tent chaos

This work proposed a new method to optimize the antenna S-parameter using a Golden Sine mechanism-based Honey Badger Algorithm that employs Tent chaos (GST-HBA). The Honey Badger Algorithm (HBA) is a promising optimization method that similar to other metaheuristic algorithms, is prone to premature convergence and lacks diversity in the population. The Honey Badger Algorithm is inspired by the behavior of honey badgers who use their sense of smell and honeyguide birds to move toward the honeycomb. Our proposed approach aims to improve the performance of HBA and enhance the accuracy of the optimization process for antenna S-parameter optimization. The approach we propose in this study leverages the strengths of both tent chaos and the golden sine mechanism to achieve fast convergence, population diversity, and a good tradeoff between exploitation and exploration. We begin by testing our approach on 20 standard benchmark functions, and then we apply it to a test suite of 8 S-parameter functions. We perform tests comparing the outcomes to those of other optimization algorithms, the result shows that the suggested algorithm is superior.

Node deployment optimization of underwater wireless sensor networks using intelligent optimization algorithm and robot collaboration

This study aims to optimize the node deployment of underwater wireless sensor networks (UWSNs) using intelligent optimization algorithms and robot collaboration technology to enhance network performance and coverage. The study employs the chemical reaction optimization (CRO) algorithm, which combines the advantages of genetic algorithms, simulated annealing algorithms, and ant colony algorithms. The CRO algorithm is enhanced through a structure correction function to determine the optimal node deployment scheme to achieve effective and optimal coverage control of the UWSN. Additionally, the flexibility and autonomy of robots are leveraged to improve the efficiency of node deployment and address the unique challenges posed by the underwater environment. Furthermore, the study conducts a comparative analysis of different intelligent optimization algorithms and demonstrates the effectiveness and advantages of the enhanced CRO algorithm in optimizing node deployment for UWSNs. The study findings reveal that the improved algorithm achieves an average coverage rate of 95.66%, significantly outperforming traditional intelligent optimization algorithms. The coverage of UWSNs can be significantly improved by utilizing the enhanced CRO algorithm and robot collaboration technology for node deployment optimization, which offers an effective approach for achieving optimal node deployment. Moreover, the rational deployment of nodes enhances the monitoring capability, resource utilization efficiency, and accuracy of environmental monitoring in underwater networks. The results of this study hold great practical significance for underwater environment monitoring, marine resource exploration, and marine scientific research.

Multilevel Threshold Segmentation of Skin Lesions in Color Images Using Coronavirus Optimization Algorithm

Skin Cancer (SC) is among the most hazardous due to its high mortality rate. Therefore, early detection of this disease would be very helpful in the treatment process. Multilevel Thresholding (MLT) is widely used for extracting regions of interest from medical images. Therefore, this paper utilizes the recent Coronavirus Disease Optimization Algorithm (COVIDOA) to address the MLT issue of SC images utilizing the hybridization of Otsu, Kapur, and Tsallis as fitness functions. Various SC images are utilized to validate the performance of the proposed algorithm. The proposed algorithm is compared to the following five meta-heuristic algorithms: Arithmetic Optimization Algorithm (AOA), Sine Cosine Algorithm (SCA), Reptile Search Algorithm (RSA), Flower Pollination Algorithm (FPA), Seagull Optimization Algorithm (SOA), and Artificial Gorilla Troops Optimizer (GTO) to prove its superiority. The performance of all algorithms is evaluated using a variety of measures, such as Mean Square Error (MSE), Peak Signal-To-Noise Ratio (PSNR), Feature Similarity Index Metric (FSIM), and Normalized Correlation Coefficient (NCC). The results of the experiments prove that the proposed algorithm surpasses several competing algorithms in terms of MSE, PSNR, FSIM, and NCC segmentation metrics and successfully solves the segmentation issue.

Profit prediction optimization using financial accounting information system by optimized DLSTM

Financial accounting information systems (FAISs) are one of the scientific fields where deep learning (DL) and swarm-based algorithms have recently seen increased use. Nevertheless, the application of these hybrid networks has become more challenging as a result of the heightened complexity imposed by extensive datasets. In order to tackle this issue, we present a new methodology that integrates the twin adjustable reinforced chimp optimization algorithm (TAR-CHOA) with deep long short-term memory (DLSTM) to forecast profits using FAISs. The main contribution of this research is the development of the TAR-CHOA algorithm, which improves the efficacy of profit prediction models. Moreover, due to the unavailability of an appropriate dataset for this particular problem, a newly formed dataset has been constructed by employing fifteen inputs based on the prior Chinese stock market Kaggle dataset. In this study, we have designed and assessed five DLSTM-based optimization algorithms, for forecasting financial accounting profit. The performance of various models has been evaluated and ranked for financial accounting profit prediction. According to our research, the best-performing DL-based model is DLSTM-TAR-CHOA. One constraint of our methodology is its dependence on historical financial accounting data, operating under the assumption that past patterns and relationships will persist in the future. Furthermore, it is important to note that the efficacy of our models may differ based on the distinct attributes and fluctuations observed in various financial markets. These identified limitations present potential avenues for future research to investigate alternative methodologies and broaden the extent of our findings.

Adaptive Guided Equilibrium Optimizer with Spiral Search Mechanism to Solve Global Optimization Problems

The equilibrium optimizer (EO) is a recently developed physics-based optimization technique for complex optimization problems. Although the algorithm shows excellent exploitation capability, it still has some drawbacks, such as the tendency to fall into local optima and poor population diversity. To address these shortcomings, an enhanced EO algorithm is proposed in this paper. First, a spiral search mechanism is introduced to guide the particles to more promising search regions. Then, a new inertia weight factor is employed to mitigate the oscillation phenomena of particles. To evaluate the effectiveness of the proposed algorithm, it has been tested on the CEC2017 test suite and the mobile robot path planning (MRPP) problem and compared with some advanced metaheuristic techniques. The experimental results demonstrate that our improved EO algorithm outperforms the comparison methods in solving both numerical optimization problems and practical problems. Overall, the developed EO variant has good robustness and stability and can be considered as a promising optimization tool.

A novel chaotic transient search optimization algorithm for global optimization, real-world engineering problems and feature selection

Metaheuristic optimization algorithms manage the search process to explore search domains efficiently and are used efficiently in large-scale, complex problems. Transient Search Algorithm (TSO) is a recently proposed physics-based metaheuristic method inspired by the transient behavior of switched electrical circuits containing storage elements such as inductance and capacitance. TSO is still a new metaheuristic method; it tends to get stuck with local optimal solutions and offers solutions with low precision and a sluggish convergence rate. In order to improve the performance of metaheuristic methods, different approaches can be integrated and methods can be hybridized to achieve faster convergence with high accuracy by balancing the exploitation and exploration stages. Chaotic maps are effectively used to improve the performance of metaheuristic methods by escaping the local optimum and increasing the convergence rate. In this study, chaotic maps are included in the TSO search process to improve performance and accelerate global convergence. In order to prevent the slow convergence rate and the classical TSO algorithm from getting stuck in local solutions, 10 different chaotic maps that generate chaotic values instead of random values in TSO processes are proposed for the first time. Thus, ergodicity and non-repeatability are improved, and convergence speed and accuracy are increased. The performance of Chaotic Transient Search Algorithm (CTSO) in global optimization was investigated using the IEEE Congress on Evolutionary Computation (CEC)'17 benchmarking functions. Its performance in real-world engineering problems was investigated for speed reducer, tension compression spring, welded beam design, pressure vessel, and three-bar truss design problems. In addition, the performance of CTSO as a feature selection method was evaluated on 10 different University of California, Irvine (UCI) standard datasets. The results of the simulation showed that Gaussian and Sinusoidal maps in most of the comparison functions, Sinusoidal map in most of the real-world engineering problems, and finally the generally proposed CTSOs in feature selection outperform standard TSO and other competitive metaheuristic methods. Real application results demonstrate that the suggested approach is more effective than standard TSO.

Research on Wind Turbine Fault Detection Based on the Fusion of ASL-CatBoost and TtRSA

The internal structure of wind turbines is intricate and precise, although the challenging working conditions often give rise to various operational faults. This study aims to address the limitations of traditional machine learning algorithms in wind turbine fault detection and the imbalance of positive and negative samples in the fault detection dataset. To achieve the real-time detection of wind turbine group faults and to capture wind turbine fault state information, an enhanced ASL-CatBoost algorithm is proposed. Additionally, a crawling animal search algorithm that incorporates the Tent chaotic mapping and t-distribution mutation strategy is introduced to assess the sensitivity of the ASL-CatBoost algorithm toward hyperparameters and the difficulty of manual hyperparameter setting. The effectiveness of the proposed hyperparameter optimization strategy, termed the TtRSA algorithm, is demonstrated through a comparison of traditional intelligent optimization algorithms using 11 benchmark test functions. When applied to the hyperparameter optimization of the ASL-CatBoost algorithm, the TtRSA-ASL-CatBoost algorithm exhibits notable enhancements in accuracy, recall, and other performance measures compared with the ASL-CatBoost algorithm and other ensemble learning algorithms. The experimental results affirm that the proposed algorithm model improvement strategy effectively enhances the wind turbine fault detection classification recognition rate.

Addressing Internet of Things security by enhanced sine cosine metaheuristics tuned hybrid machine learning model and results interpretation based on SHAP approach

An ever increasing number of electronic devices integrated into the Internet of Things (IoT) generates vast amounts of data, which gets transported via network and stored for further analysis. However, besides the undisputed advantages of this technology, it also brings risks of unauthorized access and data compromise, situations where machine learning (ML) and artificial intelligence (AI) can help with detection of potential threats, intrusions and automation of the diagnostic process. The effectiveness of the applied algorithms largely depends on the previously performed optimization, i.e., predetermined values of hyperparameters and training conducted to achieve the desired result. Therefore, to address very important issue of IoT security, this article proposes an AI framework based on the simple convolutional neural network (CNN) and extreme machine learning machine (ELM) tuned by modified sine cosine algorithm (SCA). Not withstanding that many methods for addressing security issues have been developed, there is always a possibility for further improvements and proposed research tried to fill in this gap. The introduced framework was evaluated on two ToN IoT intrusion detection datasets, that consist of the network traffic data generated in Windows 7 and Windows 10 environments. The analysis of the results suggests that the proposed model achieved superior level of classification performance for the observed datasets. Additionally, besides conducting rigid statistical tests, best derived model is interpreted by SHapley Additive exPlanations (SHAP) analysis and results findings can be used by security experts to further enhance security of IoT systems.

Automatic Segmentation of Psoriasis Skin Images Using Adaptive Chimp Optimization Algorithm-Based CNN

Psoriasis is a severe skin disease that is surveyed outwardly by dermatologists. In recent years, computer vision is the major solution for diagnosing the psoriasis skin disease by segmenting the infected skin images. Besides, many researchers had presented efficient machine learning techniques for segmenting the psoriasis skin images. Nevertheless, accuracy and time consumption of the model are further to be improved. Thus, in this work, we present adaptive chimp optimization algorithm (AChOA)-based convolutional neural network (CNN) which is introduced for automatic segmentation of psoriasis skin images. After pre-processing, the input images are segmented using AChOA-CNN model where weight and bias values of CNN are optimized with the AChOA. The search ability of ChOA is enhanced by adapting the chaotic sequence based on tent map. At final, from the segmented output images, artifacts are removed by applying the threshold module. From the simulation, we attain 97% of accuracy.

Applying modified coot optimization algorithm with artificial neural network meta-model for building energy performance optimization: A case study

Today, an important problem of the building energy performance area is carrying out multi-criteria optimizations of real building designs. To solve this problem, a new method based on a meta-model is proposed in this study. Hence, the EnergyPlus™ is used as the simulation tool for the performance simulation of the building, then a couple of the multi-criteria Modified Coot Optimization Algorithm (MCOA) dynamically combined with the artificial neural network meta-models (ANN-MM) are employed. For the sample generation applied for training and validation of ANN meta-models, an optimum way is presented by this method to minimize the whole building energy simulations needed for their training, and validate precise results of optimization. Moreover, the method is used for the thermal comfort and energy efficiency optimization of a real house to achieve the optimum balance between the heating and cooling behavior of the case building. 12 effective design variables of this case study are selected. Also, the achieved results are put in comparison with the "true" Pareto front found through an optimization method based on simulation performed for more validation. It is assumed that 1280 points are adequate in this case study to obtain precise results on the Pareto set. Thus, 75% of the required simulations' number based on physics has been saved by this size of sample considering the 5120 applied in the method based on simulation. Consequently, the optimum Pareto set of a real multi-criteria building efficiency optimization problem is achieved by the proposed method and accurate results are achieved.

Hybrid multi-strategy chaos somersault foraging chimp optimization algorithm research

To address the problems of slow convergence speed and low accuracy of the chimp optimization algorithm (ChOA), and to prevent falling into the local optimum, a chaos somersault foraging ChOA (CSFChOA) is proposed. First, the cat chaotic sequence is introduced to generate the initial solutions, and then opposition-based learning is used to select better solutions to form the initial population, which can ensure the diversity of the algorithm at the beginning and improve the convergence speed and optimum searching accuracy. Considering that the algorithm is likely to fall into local optimum in the final stage, by taking the optimal solution as the pivot, chimps with better adaptation at the mirror image position replace chimps from the original population using the somersault foraging strategy, which can increase the population diversity and expand the search scope. The optimization search tests were performed on 23 standard test functions and CEC2019 test functions, and the Wilcoxon rank sum test was used for statistical analysis. The CSFChOA was compared with the ChOA and other improved intelligent optimization algorithms. The experimental results show that the CSFChOA outperforms most of the other algorithms in terms of mean and standard deviation, which indicates that the CSFChOA performs well in terms of the convergence accuracy, convergence speed and robustness of global optimization in both low-dimensional and high-dimensional experiments. Finally, through the test and analysis comparison of two complex engineering design problems, the CSFChOA was shown to outperform other algorithms in terms of optimal cost. For the design of the speed reducer, the performance of the CSFChOA is 100% better than other algorithms in terms of optimal cost; and, for the design of a three-bar truss, the performance of the CSFChOA is 6.77% better than other algorithms in terms of optimal cost, which verifies the feasibility, applicability and superiority of the CSFChOA in practical engineering problems.

A Hybrid Deep Neural Approach for Segmenting the COVID Affection Area from the Lungs X-Ray Images

Nowadays, COVID severity prediction has attracted widely in medical research because of the disease severity. Hence, the image processing application is also utilized to analyze COVID severity identification using lungs X-ray images. Thus, several intelligent schemes were employed to detect the COVID-affected part of the lungs X-ray images. However, the traditional neural approaches reported less severity classification accuracy due to the image complexity score. So, the present study has presented a novel chimp-based Adaboost Severity Analysis (CbASA) implemented in the MATLAB environment. Hence, the lung's X-ray images are utilized to test the working performance of the designed model. All public imaging data sources contain more noisy features, so the noise features are removed in the initial hidden layer of the novel CbASA then the noise-free data is imported into the classification phase. Feature extraction, segmentation, and severity specification have been performed in the classification layer. Finally, the performance of the classification score has been measured and compared with other models. Subsequently, the presented novel CbASA has earned the finest classification outcome.

Potential of Coupling Metaheuristics-Optimized-XGBoost and SHAP in Revealing PAHs Environmental Fate

Polycyclic aromatic hydrocarbons (PAHs) refer to a group of several hundred compounds, among which 16 are identified as priority pollutants, due to their adverse health effects, frequency of occurrence, and potential for human exposure. This study is focused on benzo(a)pyrene, being considered an indicator of exposure to a PAH carcinogenic mixture. For this purpose, we have applied the XGBoost model to a two-year database of pollutant concentrations and meteorological parameters, with the aim to identify the factors which were mostly associated with the observed benzo(a)pyrene concentrations and to describe types of environments that supported the interactions between benzo(a)pyrene and other polluting species. The pollutant data were collected at the energy industry center in Serbia, in the vicinity of coal mining areas and power stations, where the observed benzo(a)pyrene maximum concentration for a study period reached 43.7 ngm-3. The metaheuristics algorithm has been used to optimize the XGBoost hyperparameters, and the results have been compared to the results of XGBoost models tuned by eight other cutting-edge metaheuristics algorithms. The best-produced model was later on interpreted by applying Shapley Additive exPlanations (SHAP). As indicated by mean absolute SHAP values, the temperature at the surface, arsenic, PM10, and total nitrogen oxide (NOx) concentrations appear to be the major factors affecting benzo(a)pyrene concentrations and its environmental fate.

Marine Predators Algorithm: A Review

Marine Predators Algorithm (MPA) is a recent nature-inspired optimizer stemmed from widespread foraging mechanisms based on Lévy and Brownian movements in ocean predators. Due to its superb features, such as derivative-free, parameter-less, easy-to-use, flexible, and simplicity, MPA is quickly evolved for a wide range of optimization problems in a short period. Therefore, its impressive characteristics inspire this review to analyze and discuss the primary MPA research studies established. In this review paper, the growth of the MPA is analyzed based on 102 research papers to show its powerful performance. The MPA inspirations and its theoretical concepts are also illustrated, focusing on its convergence behaviour. Thereafter, the MPA versions suggested improving the MPA behaviour on connecting the search space shape of real-world optimization problems are analyzed. A plethora and diverse optimization applications have been addressed, relying on MPA as the main solver, which is also described and organized. In addition, a critical discussion about the convergence behaviour and the main limitation of MPA is given. The review is end-up highlighting the main findings of this survey and suggests some possible MPA-related improvements and extensions that can be carried out in the future.

Development of a Novel Artificial Intelligence Model for Better Balancing Exploration and Exploitation

Grey Wolf optimizer (GWO) has been used in several fields of research. The main advantages of this algorithm are its simplicity, little controlling parameter, and adaptive exploratory behavior. However, similar to other metaheuristic algorithms, the GWO algorithm has several limitations. The main drawback of the GWO algorithm is its low capability to handle a multimodal search landscape. This drawback occurs because the alpha, beta, and gamma wolves tend to converge to the same solution. This paper presents HDGM – a novel hybrid optimization model of dragonfly algorithm and grey wolf optimizer, aiming to overcome the disadvantages of GWO algorithm. Dragonfly algorithm (DA) is combined with GWO in this study because DA has superior exploration ability, which allows it to search in promising areas in the search space. To verify the solution quality and performance of the HDGM algorithm, we used twenty-three test functions to compare the proposed model’s performance with that of the GWO, DA, particle swam optimization (PSO) and ant lion optimization (ALO). The results show that the hybrid algorithm provides more competitive results than the other variants in terms of solution quality, stability, and capacity to discover the global optimum.

A competitive learning-based Grey wolf Optimizer for engineering problems and its application to multi-layer perceptron training

This article presents a competitive learning-based Grey Wolf Optimizer (Clb-GWO) formulated through the introduction of competitive learning strategies to achieve a better trade-off between exploration and exploitation while promoting population diversity through the design of difference vectors. The proposed method integrates population sub-division into majority groups and minority groups with a dual search system arranged in a selective complementary manner. The proposed Clb-GWO is tested and validated through the recent CEC2020 and CEC2019 benchmarking suites followed by the optimal training of multi-layer perceptron's (MLPs) with five classification datasets and three function approximation datasets. Clb-GWO is compared against the standard version of GWO, five of its latest variants and two modern meta-heuristics. The benchmarking results and the MLP training results demonstrate the robustness of Clb-GWO. The proposed method performed competitively compared to all its competitors with statistically significant performance for the benchmarking tests. The performance of Clb-GWO the classification datasets and the function approximation datasets was excellent with lower error rates and least standard deviation rates.

Red piranha optimization (RPO): a natural inspired meta-heuristic algorithm for solving complex optimization problems

An optimization algorithm is a step-by-step procedure which aims to achieve an optimum value (maximum or minimum) of an objective function. Several natural inspired meta-heuristic algorithms have been inspired to solve complex optimization problems by utilizing the potential advantages of swarm intelligence. In this paper, a new nature-inspired optimization algorithm which mimics the social hunting behavior of Red Piranha is developed, which is called Red Piranha Optimization (RPO). Although the piranha fish is famous for its extreme ferocity and thirst for blood, it sets the best examples of cooperation and organized teamwork, especially in the case of hunting or saving their eggs. The proposed RPO is established through three sequential phases, namely; (i) searching for a prey, (ii) encircling the prey, and (iii) attacking the prey. A mathematical model is provided for each phase of the proposed algorithm. RPO has salient properties such as; (i) it is very simple and easy to implement, (ii) it has a perfect ability to bypass local optima, and (iii) it can be employed for solving complex optimization problems covering different disciplines. To ensure the efficiency of the proposed RPO, it has been applied in feature selection, which is one of the important steps in solving the classification problem. Hence, recent bio-inspired optimization algorithms as well as the proposed RPO have been employed for selecting the most important features for diagnosing Covid-19. Experimental results have proven the effectiveness of the proposed RPO as it outperforms the recent bio-inspired optimization techniques according to accuracy, execution time, micro average precision, micro average recall, macro average precision, macro average recall, and f-measure calculations.

A novel hybrid prediction model for PM2.5 concentration based on decomposition ensemble and error correction

PM_2.5 concentration is an important index to measure the degree of air pollution. It is necessary to establish an accurate PM_2.5 concentration prediction system for urban air monitoring and control. Due to the nonlinear characteristics of PM_2.5 concentration, it is difficult to predict it directly. Therefore, a novel hybrid model for PM_2.5 concentration based on improved variational mode decomposition (IVMD), outlier-robust extreme learning machine (ORELM) optimized by hybrid cuckoo search (CS), and chimp optimization algorithm (ChOA), error correction (EC) is proposed named IVMD-ChOACS-ORELM-EC. First of all, an improved VMD based on energy loss coefficient, named IVMD, is proposed. IVMD decomposes the original data to obtain K IMF components. Then, a hybrid optimization algorithm based on ChOA improved by CS is proposed, named ChOACS. The hybrid optimization algorithm is used to optimize ORELM. On this basis, the prediction model ChOACS-ORELM is proposed, and the K IMF components are predicted by ChOACS-ORELM. Finally, the EC model based on decomposition ensemble is established to further improve the prediction accuracy. The PM_2.5 concentration data collected at hourly intervals in Beijing, Shanghai, Shenyang, and Qingdao in China are used as experimental data. The experimental results show that the correlation coefficients between the prediction results and the actual values of the four cities are 0.9999, and the prediction performance of the proposed model is better than that of all comparison models.

Improved chimpanzee algorithm based on CEEMDAN combination to optimize ELM short-term wind speed prediction

The world energy structure dominated by fossil energy has brought about the depletion of fossil energy and a series of environmental pollution problems. The development of new energy has become the direction of joint efforts of China and other countries in the world. Wind energy is an important part of new energies. Accurate wind speed prediction can effectively reduce the adverse impact of wind farm fluctuation on power system. To solve the problem of low and poor accuracy of short-term wind speed prediction, a hybrid prediction model based on improved optimized extreme learning machine (ELM) is provided in this paper. The wind speed series are decomposed by using the Complementary Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN), the phase space of each modal component is reconstructed to obtain some new time series, and thus to enhance the stability of the wind speed series. Also, the improved chimpanzee optimization algorithm (CHOA) is used to determine the optimal value of the extreme learning machine (ELM) so as to predict the processed wind speed sequence. Through related empirical analysis and comparisons with other models, the hybrid prediction model reduces wind speed prediction error and improves the accuracy of wind speed prediction accuracy effectively.

Improved deep convolutional neural networks using chimp optimization algorithm for Covid19 diagnosis from the X-ray images

Applying Deep Learning (DL) in radiological images (i.e., chest X-rays) is emerging because of the necessity of having accurate and fast COVID-19 detectors. Deep Convolutional Neural Networks (DCNN) have been typically used as robust COVID-19 positive case detectors in these approaches. Such DCCNs tend to utilize Gradient Descent-Based (GDB) algorithms as the last fully-connected layers' trainers. Although GDB training algorithms have simple structures and fast convergence rates for cases with large training samples, they suffer from the manual tuning of numerous parameters, getting stuck in local minima, large training samples set requirements, and inherently sequential procedures. It is exceedingly challenging to parallelize them with Graphics Processing Units (GPU). Consequently, the Chimp Optimization Algorithm (ChOA) is presented for training the DCNN's fully connected layers in light of the scarcity of a big COVID-19 training dataset and for the purpose of developing a fast COVID-19 detector with the capability of parallel implementation. In addition, two publicly accessible datasets termed COVID-Xray-5 k and COVIDetectioNet are used to benchmark the proposed detector known as DCCN-Chimp. In order to make a fair comparison, two structures are proposed: i-6c-2 s-12c-2 s and i-8c-2 s-16c-2 s, all of which have had their hyperparameters fine-tuned. The outcomes are evaluated in comparison to standard DCNN, Hybrid DCNN plus Genetic Algorithm (DCNN-GA), and Matched Subspace classifier with Adaptive Dictionaries (MSAD). Due to the large variation in results, we employ a weighted average of the ensemble of ten trained DCNN-ChOA, with the validation accuracy of the weights being used to determine the final weights. The validation accuracy for the mixed ensemble DCNN-ChOA is 99.11%. LeNet-5 DCNN's ensemble detection accuracy on COVID-19 is 84.58%. Comparatively, the suggested DCNN-ChOA yields over 99.11% accurate detection with a false alarm rate of less than 0.89%. The outcomes show that the DCCN-Chimp can deliver noticeably superior results than the comparable detectors. The Class Activation Map (CAM) is another tool used in this study to identify probable COVID-19-infected areas. Results show that highlighted regions are completely connected with clinical outcomes, which has been verified by experts.

Improved deep convolutional neural networks using chimp optimization algorithm for Covid19 diagnosis from the X-ray images

Applying Deep Learning (DL) in radiological images (i.e., chest X-rays) is emerging because of the necessity of having accurate and fast COVID-19 detectors. Deep Convolutional Neural Networks (DCNN) have been typically used as robust COVID-19 positive case detectors in these approaches. Such DCCNs tend to utilize Gradient Descent-Based (GDB) algorithms as the last fully-connected layers' trainers. Although GDB training algorithms have simple structures and fast convergence rates for cases with large training samples, they suffer from the manual tuning of numerous parameters, getting stuck in local minima, large training samples set requirements, and inherently sequential procedures. It is exceedingly challenging to parallelize them with Graphics Processing Units (GPU). Consequently, the Chimp Optimization Algorithm (ChOA) is presented for training the DCNN's fully connected layers in light of the scarcity of a big COVID-19 training dataset and for the purpose of developing a fast COVID-19 detector with the capability of parallel implementation. In addition, two publicly accessible datasets termed COVID-Xray-5 k and COVIDetectioNet are used to benchmark the proposed detector known as DCCN-Chimp. In order to make a fair comparison, two structures are proposed: i-6c-2 s-12c-2 s and i-8c-2 s-16c-2 s, all of which have had their hyperparameters fine-tuned. The outcomes are evaluated in comparison to standard DCNN, Hybrid DCNN plus Genetic Algorithm (DCNN-GA), and Matched Subspace classifier with Adaptive Dictionaries (MSAD). Due to the large variation in results, we employ a weighted average of the ensemble of ten trained DCNN-ChOA, with the validation accuracy of the weights being used to determine the final weights. The validation accuracy for the mixed ensemble DCNN-ChOA is 99.11%. LeNet-5 DCNN's ensemble detection accuracy on COVID-19 is 84.58%. Comparatively, the suggested DCNN-ChOA yields over 99.11% accurate detection with a false alarm rate of less than 0.89%. The outcomes show that the DCCN-Chimp can deliver noticeably superior results than the comparable detectors. The Class Activation Map (CAM) is another tool used in this study to identify probable COVID-19-infected areas. Results show that highlighted regions are completely connected with clinical outcomes, which has been verified by experts.

Feature Extraction Using a Residual Deep Convolutional Neural Network (ResNet-152) and Optimized Feature Dimension Reduction for MRI Brain Tumor Classification

One of the top causes of mortality in people globally is a brain tumor. Today, biopsy is regarded as the cornerstone of cancer diagnosis. However, it faces difficulties, including low sensitivity, hazards during biopsy treatment, and a protracted waiting period for findings. In this context, developing non-invasive and computational methods for identifying and treating brain cancers is crucial. The classification of tumors obtained from an MRI is crucial for making a variety of medical diagnoses. However, MRI analysis typically requires much time. The primary challenge is that the tissues of the brain are comparable. Numerous scientists have created new techniques for identifying and categorizing cancers. However, due to their limitations, the majority of them eventually fail. In that context, this work presents a novel way of classifying multiple types of brain tumors. This work also introduces a segmentation algorithm known as Canny Mayfly. Enhanced chimpanzee optimization algorithm (EChOA) is used to select the features by minimizing the dimension of the retrieved features. ResNet-152 and the softmax classifier are then used to perform the feature classification process. Python is used to carry out the proposed method on the Figshare dataset. The accuracy, specificity, and sensitivity of the proposed cancer classification system are just a few of the characteristics that are used to evaluate its overall performance. According to the final evaluation results, our proposed strategy outperformed, with an accuracy of 98.85%.

An enhanced aquila optimization algorithm with velocity-aided global search mechanism and adaptive opposition-based learning

The aquila optimization algorithm (AO) is an efficient swarm intelligence algorithm proposed recently. However, considering that AO has better performance and slower late convergence speed in the optimization process. For solving this effect of AO and improving its performance, this paper proposes an enhanced aquila optimization algorithm with a velocity-aided global search mechanism and adaptive opposition-based learning (VAIAO) which is based on AO and simplified Aquila optimization algorithm (IAO). In VAIAO, the velocity and acceleration terms are set and included in the update formula. Furthermore, an adaptive opposition-based learning strategy is introduced to improve local optima. To verify the performance of the proposed VAIAO, 27 classical benchmark functions, the Wilcoxon statistical sign-rank experiment, the Friedman test and five engineering optimization problems are tested. The results of the experiment show that the proposed VAIAO has better performance than AO, IAO and other comparison algorithms. This also means the introduction of these two strategies enhances the global exploration ability and convergence speed of the algorithm.

A Novel Multi-Objective Binary Chimp Optimization Algorithm for Optimal Feature Selection: Application of Deep-Learning-Based Approaches for SAR Image Classification

Removing redundant features and improving classifier performance necessitates the use of meta-heuristic and deep learning (DL) algorithms in feature selection and classification problems. With the maturity of DL tools, many data-driven polarimetric synthetic aperture radar (POLSAR) representation models have been suggested, most of which are based on deep convolutional neural networks (DCNNs). In this paper, we propose a hybrid approach of a new multi-objective binary chimp optimization algorithm (MOBChOA) and DCNN for optimal feature selection. We implemented the proposed method to classify POLSAR images from San Francisco, USA. To do so, we first performed the necessary preprocessing, including speckle reduction, radiometric calibration, and feature extraction. After that, we implemented the proposed MOBChOA for optimal feature selection. Finally, we trained the fully connected DCNN to classify the pixels into specific land-cover labels. We evaluated the performance of the proposed MOBChOA-DCNN in comparison with nine competitive methods. Our experimental results with the POLSAR image datasets show that the proposed architecture had a great performance for different important optimization parameters. The proposed MOBChOA-DCNN provided fewer features (27) and the highest overall accuracy. The overall accuracy values of MOBChOA-DCNN on the training and validation datasets were 96.89% and 96.13%, respectively, which were the best results. The overall accuracy of SVM was 89.30%, which was the worst result. The results of the proposed MOBChOA on two real-world benchmark problems were also better than the results with the other methods. Furthermore, it was shown that the MOBChOA-DCNN performed better than methods from previous studies.

Predicting COVID-19 using lioness optimization algorithm and graph convolution network

In this paper, a graph convolution network prediction model based on the lioness optimization algorithm (LsOA-GCN) is proposed to predict the cumulative number of confirmed COVID-19 cases in 17 regions of Hubei Province from March 23 to March 29, 2020, according to the transmission characteristics of COVID-19. On the one hand, Spearman correlation analysis with delay days and LsOA are used to capture the dynamic changes of feature information to obtain the temporal features. On the other hand, the graph convolutional network is used to capture the topological structure of the city network, so as to obtain spatial information and finally realize the prediction task. Then, we evaluate this model through performance evaluation indicators and statistical test methods and compare the results of LsOA-GCN with 10 representative prediction methods in the current epidemic prediction study. The experimental results show that the LsOA-GCN prediction model is significantly better than other prediction methods in all indicators and can successfully capture spatio-temporal information from feature data, thereby achieving accurate prediction of epidemic trends in different regions of Hubei Province.

Group-individual multi-mode cooperative teaching-learning-based optimization algorithm and an industrial engineering application

This paper modifies the original Teaching-Learning-based Optimization (TLBO) algorithm to present a novel Group-Individual Multi-Mode Cooperative Teaching-Learning-based Optimization (CTLBO) algorithm. This algorithm introduces a new preparation phase before the teaching and learning phases and applies multiple teacher-learner cooperation strategies in teaching and learning processes. In the preparation phase, teacher-learner interaction and teacher self-learning mechanism are applied. In the teaching phase, class-teaching and performance-based group-teaching operators are applied. In the learning phase, neighbor learning, student self-learning and team-learning strategies are mixed together to form three operators. Experiments indicate that CTLBO has significant improvement in accuracy and convergence ability compared with original TLBO in solving large scale problems and outperforms other compared variants of TLBO in literature and other 9 meta-heuristic algorithms. A large-scale industrial engineering problem—warehouse materials inventory optimization problem is taken as application case, comparison results show that CTLBO can effectively solve the large-scale real problem with 1000 decision variables, while the accuracies of TLBO and other meta-heuristic algorithm are far lower than CLTBO, revealing that CTLBO can far outperform other algorithms. CTLBO is an excellent algorithm for solving large scale complex optimization issues.