Toward an optimal kernel extreme learning machine using a chaotic moth-flame optimization strategy with applications in medical diagnoses

An Enhanced Team-Oriented Swarm Optimization Algorithm (ETOSO) for Robust and Efficient High-Dimensional Search

This paper introduces the Enhanced Team-Oriented Swarm Optimization (ETOSO) algorithm, a novel refinement of the Team-Oriented Swarm Optimization (TOSO) algorithm aimed at addressing the stagnation problem commonly encountered in nature-inspired optimization approaches. ETOSO enhances TOSO by integrating innovative strategies for exploration and exploitation, resulting in a simplified algorithm that demonstrates superior performance across a broad spectrum of benchmark functions, particularly in high-dimensional search spaces. A comprehensive comparative evaluation and statistical tests against 26 established nature-inspired optimization algorithms (NIOAs) across 15 benchmark functions and dimensions (D = 2, 5, 10, 30, 50, 100, 200) confirm ETOSO's superiority relative to solution accuracy, convergence speed, computational complexity, and consistency.

Secretary bird optimization algorithm based on quantum computing and multiple strategies improvement for KELM diabetes classification

The classification of chronic diseases has long been a prominent research focus in the field of public health, with widespread application of machine learning algorithms. Diabetes is one of the chronic diseases with a high prevalence worldwide and is considered a disease in its own right. Given the widespread nature of this chronic condition, numerous researchers are striving to develop robust machine learning algorithms for accurate classification. This study introduces a revolutionary approach for accurately classifying diabetes, aiming to provide new methodologies. An improved Secretary Bird Optimization Algorithm (QHSBOA) is proposed in combination with Kernel Extreme Learning Machine (KELM) for a diabetes classification prediction model. First, the Secretary Bird Optimization Algorithm (SBOA) is enhanced by integrating a particle swarm optimization search mechanism, dynamic boundary adjustments based on optimal individuals, and quantum computing-based t-distribution variations. The performance of QHSBOA is validated using the CEC2017 benchmark suite. Subsequently, QHSBOA is used to optimize the kernel penalty parameter [Formula: see text] and bandwidth [Formula: see text] of the KELM. Comparative experiments with other classification models are conducted on diabetes datasets. The experimental results indicate that the QHSBOA-KELM classification model outperforms other comparative models in four evaluation metrics: accuracy (ACC), Matthews correlation coefficient (MCC), sensitivity, and specificity. This approach offers an effective method for the early diagnosis and prediction of diabetes.

Gaussian barebone mechanism and wormhole strategy enhanced moth flame optimization for global optimization and medical diagnostics

Moth Flame Optimization (MFO) is a swarm intelligence algorithm inspired by the nocturnal flight mode of moths, and it has been widely used in various fields due to its simple structure and high optimization efficiency. Nonetheless, a notable limitation is its susceptibility to local optimality because of the absence of a well-balanced exploitation and exploration phase. Hence, this paper introduces a novel enhanced MFO algorithm (BWEMFO) designed to improve algorithmic performance. This improvement is achieved by incorporating a Gaussian barebone mechanism, a wormhole strategy, and an elimination strategy into the MFO. To assess the effectiveness of BWEMFO, a series of comparison experiments is conducted, comparing it against conventional metaheuristic algorithms, advanced metaheuristic algorithms, and various MFO variants. The experimental results reveal a significant enhancement in both the convergence speed and the capability to escape local optima with the implementation of BWEMFO. The scalability of the algorithm is confirmed through benchmark functions. Employing BWEMFO, we optimize the kernel parameters of the kernel-limit learning machine, thereby crafting the BWEMFO-KELM methodology for medical diagnosis and prediction. Subsequently, BWEMFO-KELM undergoes diagnostic and predictive experimentation on three distinct medical datasets: the breast cancer dataset, colorectal cancer datasets, and mammographic dataset. Through comparative analysis against five alternative machine learning methodologies across four evaluation metrics, our experimental findings evince the superior diagnostic accuracy and reliability of the proposed BWEMFO-KELM model.

Multi-kernel support vector regression with improved moth-flame optimization algorithm for software effort estimation

In this paper, a novel Moth-Flame Optimization (MFO) algorithm, namely MFO algorithm enhanced by Multiple Improvement Strategies (MISMFO) is proposed for solving parameter optimization in Multi-Kernel Support Vector Regressor (MKSVR), and the MISMFO-MKSVR model is further employed to deal with the software effort estimation problems. In MISMFO, the logistic chaotic mapping is applied to increase initial population diversity, while the mutation and flame number phased reduction mechanisms are carried out to improve the search efficiency, as well the adaptive weight adjustment mechanism is used to accelerate convergence and balance exploration and exploitation. The MISMFO model is verified on fifteen benchmark functions and CEC 2020 test set. The results show that the MISMFO has advantages over other meta-heuristic algorithms and MFO variants in terms of convergence speed and accuracy. Additionally, the MISMFO-MKSVR model is tested by simulations on five software effort datasets and the results demonstrate that the proposed model has better performance in software effort estimation problem. The Matlab code of MISMFO can be found at https://github.com/loadstar1997/MISMFO .

Advanced forecasting of COVID-19 epidemic: Leveraging ensemble models, advanced optimization, and decomposition techniques

In the global effort to address the outbreak of the new coronavirus pneumonia (COVID-19) pandemic, accurate forecasting of epidemic patterns has become crucial for implementing successful interventions aimed at preventing and controlling the spread of the disease. The correct prediction of the course of COVID-19 outbreaks is a complex and challenging task, mainly because of the significant volatility in the data series related to COVID-19. Previous studies have been limited by the exclusive use of individual forecasting techniques in epidemic modeling, disregarding the integration of diverse prediction procedures. The lack of attention to detail in this situation can yield worse-than-ideal results. Consequently, this study introduces a novel ensemble framework that integrates three machine learning methods (kernel ridge regression (KRidge), Deep random vector functional link (dRVFL), and ridge regression) within a linear relationship (L-KRidge-dRVFL-Ridge). The optimization of this framework is accomplished through a distinctive approach, specifically adaptive differential evolution and particle swarm optimization (A-DEPSO). Moreover, an effective decomposition method, known as time-varying filter empirical mode decomposition (TVF-EMD), is employed to decompose the input variables. A feature selection technique, specifically using the light gradient boosting machine (LGBM), is also implemented to extract the most influential input variables. The daily datasets of COVID-19 collected from two countries, namely Italy and Poland, were used as the experimental examples. Additionally, all models are implemented to forecast COVID-19 at two-time horizons: 10- and 14-day ahead (t+10 and t+14). According to the results, the proposed model can yield higher correlation coefficient (R) for both case studies: Italy (t+10 = 0.965, t+14 = 0.961) and Poland (t+10 = 0.952, t+14 = 0.940) than the other models. The experimental results demonstrate that the model suggested in this paper has outstanding results in various kinds of complex epidemic prediction situations. The proposed ensemble model demonstrates exceptional accuracy and resilience, outperforming all similar models in terms of efficacy.

The path from task-specific to general purpose artificial intelligence for medical diagnostics: A bibliometric analysis

Artificial intelligence (AI) has revolutionized many fields, and its potential in healthcare has been increasingly recognized. Based on diverse data sources such as imaging, laboratory tests, medical records, and electrophysiological data, diagnostic AI has witnessed rapid development in recent years. A comprehensive understanding of the development status, contributing factors, and their relationships in the application of AI to medical diagnostics is essential to further promote its use in clinical practice. In this study, we conducted a bibliometric analysis to explore the evolution of task-specific to general-purpose AI for medical diagnostics. We used the Web of Science database to search for relevant articles published between 2010 and 2023, and applied VOSviewer, the R package Bibliometrix, and CiteSpace to analyze collaborative networks and keywords. Our analysis revealed that the field of AI in medical diagnostics has experienced rapid growth in recent years, with a focus on tasks such as image analysis, disease prediction, and decision support. Collaborative networks were observed among researchers and institutions, indicating a trend of global cooperation in this field. Additionally, we identified several key factors contributing to the development of AI in medical diagnostics, including data quality, algorithm design, and computational power. Challenges to progress in the field include model explainability, robustness, and equality, which will require multi-stakeholder, interdisciplinary collaboration to tackle. Our study provides a holistic understanding of the path from task-specific, mono-modal AI toward general-purpose, multimodal AI for medical diagnostics. With the continuous improvement of AI technology and the accumulation of medical data, we believe that AI will play a greater role in medical diagnostics in the future.

Hierarchical Harris hawks optimizer for feature selection

INTRODUCTION

The main feature selection methods include filter, wrapper-based, and embedded methods. Because of its characteristics, the wrapper method must include a swarm intelligence algorithm, and its performance in feature selection is closely related to the algorithm's quality. Therefore, it is essential to choose and design a suitable algorithm to improve the performance of the feature selection method based on the wrapper. Harris hawks optimization (HHO) is a superb optimization approach that has just been introduced. It has a high convergence rate and a powerful global search capability but it has an unsatisfactory optimization effect on high dimensional problems or complex problems. Therefore, we introduced a hierarchy to improve HHO's ability to deal with complex problems and feature selection.

OBJECTIVES

To make the algorithm obtain good accuracy with fewer features and run faster in feature selection, we improved HHO and named it EHHO. On 30 UCI datasets, the improved HHO (EHHO) can achieve very high classification accuracy with less running time and fewer features.

METHODS

We first conducted extensive experiments on 23 classical benchmark functions and compared EHHO with many state-of-the-art metaheuristic algorithms. Then we transform EHHO into binary EHHO (bEHHO) through the conversion function and verify the algorithm's ability in feature extraction on 30 UCI data sets.

RESULTS

Experiments on 23 benchmark functions show that EHHO has better convergence speed and minimum convergence than other peers. At the same time, compared with HHO, EHHO can significantly improve the weakness of HHO in dealing with complex functions. Moreover, on 30 datasets in the UCI repository, the performance of bEHHO is better than other comparative optimization algorithms.

CONCLUSION

Compared with the original bHHO, bEHHO can achieve excellent classification accuracy with fewer features and is also better than bHHO in running time.

An accelerated sine mapping whale optimizer for feature selection

An improved whale optimization algorithm (SWEWOA) is presented for global optimization issues. Firstly, the sine mapping initialization strategy (SS) is used to generate the population. Secondly, the escape energy (EE) is introduced to balance the exploration and exploitation of WOA. Finally, the wormhole search (WS) strengthens the capacity for exploitation. The hybrid design effectively reinforces the optimization capability of SWEWOA. To prove the effectiveness of the design, SWEWOA is performed in two test sets, CEC 2017 and 2022, respectively. The advantage of SWEWOA is demonstrated in 26 superior comparison algorithms. Then a new feature selection method called BSWEWOA-KELM is developed based on the binary SWEWOA and kernel extreme learning machine (KELM). To verify its performance, 8 high-performance algorithms are selected and experimentally studied in 16 public datasets of different difficulty. The test results demonstrate that SWEWOA performs excellently in selecting the most valuable features for classification problems.

Prediction of fractional flow reserve with enhanced ant lion optimized support vector machine

The evaluation of coronary morphology provides important guidance for the treatment of coronary heart disease (CHD). A chaotic Gaussian mutation antlion optimizer algorithm (CGALO) is proposed in the paper, and it is combined with SVM to construct a classification prediction model for Fractional flow reserve (FFR). To overcome the limitations of the original antlion optimizer (ALO) algorithm, the chaotic Gaussian mutation strategy is introduced, which leads to an improvement in its convergence speed and accuracy. To evaluate the proposed algorithm's performance, comparative experiments were conducted on 23 benchmark functions alongside 12 other cutting-edge optimization algorithms. The experimental outcomes demonstrate that the proposed algorithm achieves superior convergence accuracy and speed compared to the alternative comparison algorithms. Additionally, it is combined with SVM and FS to construct a hierarchical FFR classification model, which is utilized to make effective predictions for 84 patients at the affiliated hospital of medical school, Ningbo university. The experimental results demonstrate that the proposed model achieves an average accuracy of 92%. Moreover, it concludes that smoking history, number of lesion vessels, lesion location, diffuse lesions and ST segment changes, and other factors are the most critical indicators for FFR. Therefore, the model that has been established is a new FFR intelligent classification prediction technology that can effectively assist doctors in making corresponding decisions and evaluation plans.

Improved Colony Predation Algorithm Optimized Convolutional Neural Networks for Electrocardiogram Signal Classification

Recently, swarm intelligence algorithms have received much attention because of their flexibility for solving complex problems in the real world. Recently, a new algorithm called the colony predation algorithm (CPA) has been proposed, taking inspiration from the predatory habits of groups in nature. However, CPA suffers from poor exploratory ability and cannot always escape solutions known as local optima. Therefore, to improve the global search capability of CPA, an improved variant (OLCPA) incorporating an orthogonal learning strategy is proposed in this paper. Then, considering the fact that the swarm intelligence algorithm can go beyond the local optimum and find the global optimum solution, a novel OLCPA-CNN model is proposed, which uses the OLCPA algorithm to tune the parameters of the convolutional neural network. To verify the performance of OLCPA, comparison experiments are designed to compare with other traditional metaheuristics and advanced algorithms on IEEE CEC 2017 benchmark functions. The experimental results show that OLCPA ranks first in performance compared to the other algorithms. Additionally, the OLCPA-CNN model achieves high accuracy rates of 97.7% and 97.8% in classifying the MIT-BIH Arrhythmia and European ST-T datasets.

Whale optimization with random contraction and Rosenbrock method for COVID-19 disease prediction

Coronavirus Disease 2019 (COVID-19), instigated by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2), has hugely impacted global public health. To identify and intervene in critically ill patients early, this paper proposes an efficient, intelligent prediction model based on the machine learning approach, which combines the improved whale optimization algorithm (RRWOA) with the k-nearest neighbor (KNN) classifier. In order to improve the problem that WOA is prone to fall into local optimum, an improved version named RRWOA is proposed based on the random contraction strategy (RCS) and the Rosenbrock method. To verify the capability of the proposed algorithm, RRWOA is tested against nine classical metaheuristics, nine advanced metaheuristics, and seven well-known WOA variants based on 30 IEEE CEC2014 competition functions, respectively. The experimental results in mean, standard deviation, the Friedman test, and the Wilcoxon signed-rank test are considered, proving that RRWOA won first place on 18, 24, and 25 test functions, respectively. In addition, a binary version of the algorithm, called BRRWOA, is developed for feature selection problems. An efficient prediction model based on BRRWOA and KNN classifier is proposed and compared with seven existing binary metaheuristics based on 15 datasets of UCI repositories. The experimental results show that the proposed algorithm obtains the smallest fitness value in eleven datasets and can solve combinatorial optimization problems, indicating that it still performs well in discrete cases. More importantly, the model was compared with five other algorithms on the COVID-19 dataset. The experiment outcomes demonstrate that the model offers a scientific framework to support clinical diagnostic decision-making. Therefore, RRWOA is an effectively improved optimizer with efficient value.

Gaussian bare-bone slime mould algorithm: performance optimization and case studies on truss structures

The slime mould algorithm (SMA) is a new meta-heuristic algorithm recently proposed. The algorithm is inspired by the foraging behavior of polycephalus slime moulds. It simulates the behavior and morphological changes of slime moulds during foraging through adaptive weights. Although the original SMA's performance is better than most swarm intelligence algorithms, it still has shortcomings, such as quickly falling into local optimal values and insufficient exploitation. This paper proposes a Gaussian barebone mutation enhanced SMA (GBSMA) to alleviate the original SMA's shortcomings. First of all, the Gaussian function in the Gaussian barebone accelerates the convergence while also expanding the search space, which improves the algorithm exploration and exploitation capabilities. Secondly, the differential evolution (DE) update strategy in the Gaussian barebone, using rand as the guiding vector. It also enhances the algorithm's global search performance to a certain extent. Also, the greedy selection is introduced on this basis, which prevents individuals from performing invalid position updates. In the IEEE CEC2017 test function, the proposed GBSMA is compared with a variety of meta-heuristic algorithms to verify the performance of GBSMA. Besides, GBSMA is applied to solve truss structure optimization problems. Experimental results show that the convergence speed and solution accuracy of the proposed GBSMA are significantly better than the original SMA and other similar products.

Supplementary Information

The online version contains supplementary material available at 10.1007/s10462-022-10370-7.

bSRWPSO-FKNN: A boosted PSO with fuzzy K-nearest neighbor classifier for predicting atopic dermatitis disease

Introduction

Atopic dermatitis (AD) is an allergic disease with extreme itching that bothers patients. However, diagnosing AD depends on clinicians' subjective judgment, which may be missed or misdiagnosed sometimes.

Methods

This paper establishes a medical prediction model for the first time on the basis of the enhanced particle swarm optimization (SRWPSO) algorithm and the fuzzy K-nearest neighbor (FKNN), called bSRWPSO-FKNN, which is practiced on a dataset related to patients with AD. In SRWPSO, the Sobol sequence is introduced into particle swarm optimization (PSO) to make the particle distribution of the initial population more uniform, thus improving the population's diversity and traversal. At the same time, this study also adds a random replacement strategy and adaptive weight strategy to the population updating process of PSO to overcome the shortcomings of poor convergence accuracy and easily fall into the local optimum of PSO. In bSRWPSO-FKNN, the core of which is to optimize the classification performance of FKNN through binary SRWPSO.

Results

To prove that the study has scientific significance, this paper first successfully demonstrates the core advantages of SRWPSO in well-known algorithms through benchmark function validation experiments. Secondly, this article demonstrates that the bSRWPSO-FKNN has practical medical significance and effectiveness through nine public and medical datasets.

Discussion

The 10 times 10-fold cross-validation experiments demonstrate that bSRWPSO-FKNN can pick up the key features of AD, including the content of lymphocytes (LY), Cat dander, Milk, Dermatophagoides Pteronyssinus/Farinae, Ragweed, Cod, and Total IgE. Therefore, the established bSRWPSO-FKNN method practically aids in the diagnosis of AD.

A modified reptile search algorithm for global optimization and image segmentation: Case study brain MRI images

In this paper, we proposed an enhanced reptile search algorithm (RSA) for global optimization and selected optimal thresholding values for multilevel image segmentation. RSA is a recent metaheuristic optimization algorithm depending on the hunting behavior of crocodiles. RSA is inclined to inadequate diversity, local optima, and unbalanced exploitation abilities as other metaheuristic algorithms. The RUNge Kutta optimizer (RUN) is a novel metaheuristic algorithm that has demonstrated effectiveness in solving real-world optimization problems. The enhanced solution quality (ESQ) in RUN utilizes the thus-far best solution to promote the quality of solutions, improve the convergence speed, and effectively balance the exploration and exploitation steps. Also, the Scale factor (SF) has a randomized adaptation nature, which helps RUN in further improving the exploration and exploitation steps. This parameter ensures a smooth transition from exploration to exploitation. In order to mitigate the drawbacks of the RSA algorithm, this paper proposed a modified RSA (mRSA), which combines the RSA algorithm with the RUN. The ESQ mechanism and the scale factor boost the original RSA's performance, enhance convergence speed, bypass local optimum, and enhance the balance between exploitation and exploration. The validity of mRSA was verified using two experimental sequences. First, we applied mRSA to CEC'2020 benchmark functions of various types and dimensions, showing that mRSA has more robust search capabilities than the original RSA and popular counterpart algorithms concerning statistical, convergence, and diversity measurements. The second experiment evaluated mRSA for a real-world application to solve magnetic resonance imaging (MRI) brain image segmentation. Overall experimental results confirm that the mRSA has a strong optimization ability. Also, mRSA method is a more successful multilevel thresholding segmentation and outperforms comparison methods according to different performance measures.

Tuberculous pleural effusion prediction using ant colony optimizer with grade-based search assisted support vector machine

Introduction

Although tuberculous pleural effusion (TBPE) is simply an inflammatory response of the pleura caused by tuberculosis infection, it can lead to pleural adhesions and cause sequelae of pleural thickening, which may severely affect the mobility of the chest cavity.

Methods

In this study, we propose bGACO-SVM, a model with good diagnostic power, for the adjunctive diagnosis of TBPE. The model is based on an enhanced continuous ant colony optimization (ACOR) with grade-based search technique (GACO) and support vector machine (SVM) for wrapped feature selection. In GACO, grade-based search greatly improves the convergence performance of the algorithm and the ability to avoid getting trapped in local optimization, which improves the classification capability of bGACO-SVM.

Results

To test the performance of GACO, this work conducts comparative experiments between GACO and nine basic algorithms and nine state-of-the-art variants as well. Although the proposed GACO does not offer much advantage in terms of time complexity, the experimental results strongly demonstrate the core advantages of GACO. The accuracy of bGACO-predictive SVM was evaluated using existing datasets from the UCI and TBPE datasets.

Discussion

In the TBPE dataset trial, 147 TBPE patients were evaluated using the created bGACO-SVM model, showing that the bGACO-SVM method is an effective technique for accurately predicting TBPE.

Detection of pulmonary embolism severity using clinical characteristics, hematological indices, and machine learning techniques

INTRODUCTION

Pulmonary embolism (PE) is a cardiopulmonary condition that can be fatal. PE can lead to sudden cardiovascular collapse and is potentially life-threatening, necessitating risk classification to modify therapy following the diagnosis of PE. We collected clinical characteristics, routine blood data, and arterial blood gas analysis data from all 139 patients.

METHODS

Combining these data, this paper proposes a PE risk stratified prediction framework based on machine learning technology. An improved algorithm is proposed by adding sobol sequence and black hole mechanism to the cuckoo search algorithm (CS), called SBCS. Based on the coupling of the enhanced algorithm and the kernel extreme learning machine (KELM), a prediction framework is also proposed.

RESULTS

To confirm the overall performance of SBCS, we run benchmark function experiments in this work. The results demonstrate that SBCS has great convergence accuracy and speed. Then, tests based on seven open data sets are carried out in this study to verify the performance of SBCS on the feature selection problem. To further demonstrate the usefulness and applicability of the SBCS-KELM framework, this paper conducts aided diagnosis experiments on PE data collected from the hospital.

DISCUSSION

The experiment findings show that the indicators chosen, such as syncope, systolic blood pressure (SBP), oxygen saturation (SaO2%), white blood cell (WBC), neutrophil percentage (NEUT%), and others, are crucial for the feature selection approach presented in this study to assess the severity of PE. The classification results reveal that the prediction model's accuracy is 99.26% and its sensitivity is 98.57%. It is expected to become a new and accurate method to distinguish the severity of PE.

An efficient multi-threshold image segmentation for skin cancer using boosting whale optimizer

Due to the terrible manifestations of skin cancer, it seriously disturbs the quality of life status and health of patients, so we needs treatment plans to detect it early and avoid it causing more harm to patients. Medical disease image threshold segmentation technique can well extract the region of interest and effectively assist in disease recognition. Moreover, in multi-threshold image segmentation, the selection of the threshold set determines the image segmentation quality. Among the common threshold selection methods, the selection based on metaheuristic algorithm has the advantages of simplicity, easy implementation and avoidable local optimization. However, different algorithms have different performances for different medical disease images. For example, the Whale Optimization Algorithm (WOA) does not give a satisfactory performance for thresholding skin cancer images. We propose an improved WOA (LCWOA) in which the Levy operator and chaotic random mutation strategy are introduced to enhance the ability of the algorithm to jump out of the local optimum and to explore the search space. Comparing with different existing WOA variants on the CEC2014 function set, our proposed and improved algorithm improves the efficiency of the search. Experimental results show that our method outperforms the extant WOA variants in terms of optimization performances, improving the convergence accuracy and velocity. The method is also applied to solve the threshold selection in the skin cancer image segmentation problem, and LCWOA also gives excellent performance in obtaining optimal segmentation results.

Multi-threshold image segmentation for melanoma based on Kapur’s entropy using enhanced ant colony optimization

Melanoma is a malignant tumor formed by the cancerous transformation of melanocytes, and its medical images contain much information. However, the percentage of the critical information in the image is small, and the noise is non-uniformly distributed. We propose a new multi-threshold image segmentation model based on the two-dimensional histogram approach to the above problem. We present an enhanced ant colony optimization for continuous domains (EACOR) in the proposed model based on the soft besiege and chase strategies. Further, EACOR is combined with two-dimensional Kapur’s entropy to search for the optimal thresholds. An experiment on the IEEE CEC2014 benchmark function was conducted to measure the reliable global search capability of the EACOR algorithm in the proposed model. Moreover, we have also conducted several sets of experiments to test the validity of the image segmentation model proposed in this paper. The experimental results show that the segmented images from the proposed model outperform the comparison method in several evaluation metrics. Ultimately, the model proposed in this paper can provide high-quality samples for subsequent analysis of melanoma pathology images.

An evolutionary machine learning for multiple myeloma using Runge Kutta Optimizer from multi characteristic indexes

Multiple myeloma (MM) is a malignant plasma cell disease that is the second most prevalent hematological malignancy in high-income nations and accounts for around 1.8% of all cancers and 18% of hematologic malignancies in the United States. In this research, we try to design a machine learning framework for MM diagnosis from multi characteristic indexes using slime mould Runge Kutta Optimizer (MSRUN) and kernel extreme learning machine, which is called as MSRUN-KELM. An efficient slime mould learning operator is introduced to the initial Runge Kutta Optimizer in MSRUN, ensuring that the trade-off between intensity and diversity is satisfied. The MSRUN was evaluated using IEEE CEC2014 benchmark functions, and the statistical results indicate a significant increase in the search performance of MSRUN. In MSRUN-KELM, kernel extreme machine learning is constructed on MM from multi-characteristic indexes with MSRUN, parameter optimization, and feature selection synchronized by MSRUN. The results of MSRUN-KELM on MM are accuracy of 93.88%, a Matthews correlation coefficient of 0.922677, and sensitivities of 93.41% and 93.19%. The suggested MSRUN-KELM may be utilized to analyze MM from multi-characteristic indexes well, and it can be treated as a potential tool for MM diagnosis.

Multi-Strategy Learning Boosted Colony Predation Algorithm for Photovoltaic Model Parameter Identification

Modeling solar systems necessitates the effective identification of unknown and variable photovoltaic parameters. To efficiently convert solar energy into electricity, these parameters must be precise. The research introduces the multi-strategy learning boosted colony predation algorithm (MLCPA) for optimizing photovoltaic parameters and boosting the efficiency of solar power conversion. In MLCPA, opposition-based learning can be used to investigate each individual's opposing position, thereby accelerating convergence and preserving population diversity. Level-based learning categorizes individuals according to their fitness levels and treats them differently, allowing for a more optimal balance between variation and intensity during optimization. On a variety of benchmark functions, the MLCPA's performance is compared to the performance of the best algorithms currently in use. On a variety of benchmark functions, the MLCPA's performance is compared to that of existing methods. MLCPA is then used to estimate the parameters of the single, double, and photovoltaic modules. Last but not least, the stability of the proposed MLCPA algorithm is evaluated on the datasheets of many manufacturers at varying temperatures and irradiance levels. Statistics have demonstrated that the MLCPA is more precise and dependable in predicting photovoltaic mode critical parameters, making it a viable tool for solar system parameter identification issues.

Immunity-based Ebola optimization search algorithm for minimization of feature extraction with reduction in digital mammography using CNN models

Feature classification in digital medical images like mammography presents an optimization problem which researchers often neglect. The use of a convolutional neural network (CNN) in feature extraction and classification has been widely reported in the literature to have achieved outstanding performance and acceptance in the disease detection procedure. However, little emphasis is placed on ensuring that only discriminant features extracted by the convolutional operations are passed on to the classifier, to avoid bottlenecking the classification operation. Unfortunately, since this has been left unaddressed, a subtle performance impairment has resulted from this omission. Therefore, this study is devoted to addressing these drawbacks using a metaheuristic algorithm to optimize the number of features extracted by the CNN, so that suggestive features are applied for the classification process. To achieve this, a new variant of the Ebola-based optimization algorithm is proposed, based on the population immunity concept and the use of a chaos mapping initialization strategy. The resulting algorithm, called the immunity-based Ebola optimization search algorithm (IEOSA), is applied to the optimization problem addressed in the study. The optimized features represent the output from the IEOSA, which receives the noisy and unfiltered detected features from the convolutional process as input. An exhaustive evaluation of the IEOSA was carried out using classical and IEEE CEC benchmarked functions. A comparative analysis of the performance of IEOSA is presented, with some recent optimization algorithms. The experimental result showed that IEOSA performed well on all the tested benchmark functions. Furthermore, IEOSA was then applied to solve the feature enhancement and selection problem in CNN for better prediction of breast cancer in digital mammography. The classification accuracy returned by the IEOSA method showed that the new approach improved the classification process on detected features when using CNN models.

Automatic Parking Path Optimization Based on Immune Moth Flame Algorithm for Intelligent Vehicles

Automatic parking path optimization is a key point for automatic parking. However, it is difficult to obtain the smooth, accurate and optimal parking path by using traditional automatic parking optimization algorithms. So, based on the automatic parking path optimization model for cubic spline interpolation, an improved automatic parking path optimization based on the immune moth flame algorithm is proposed for intelligent vehicles. Firstly, to enhance the global optimization performance, an automatic parking path optimization model for cubic spline interpolation is designed by using shortest parking path as optimization target. Secondly, an improved immune moth flame algorithm (IIMFO) based on the immune mechanism, Gaussian mutation mechanism and opposition-based learning strategy is proposed, and an adaptive decreasing inertia weight coefficient is integrated into the moth flame algorithm so that these strategies can improve the balance quality between global search and local development effectively. Finally, the optimization results on the several common test functions show that the IIMFO algorithm proposed in this paper has higher optimization precision. Furthermore, the simulation and semi-automatic experiment results of automatic parking path optimization practical cases show that the improved automatic parking path optimization based on the immune moth flame algorithm for intelligent vehicles has a better optimization effect than that of the traditional automatic parking optimization algorithms.

Analysis of COVID-19 severity from the perspective of coagulation index using evolutionary machine learning with enhanced brain storm optimization

Coronavirus 2019 (COVID-19) is an extreme acute respiratory syndrome. Early diagnosis and accurate assessment of COVID-19 are not available, resulting in ineffective therapeutic therapy. This study designs an effective intelligence framework to early recognition and discrimination of COVID-19 severity from the perspective of coagulation indexes. The framework is proposed by integrating an enhanced new stochastic optimizer, a brain storm optimizing algorithm (EBSO), with an evolutionary machine learning algorithm called EBSO-SVM. Fast convergence and low risk of the local stagnant can be guaranteed for EBSO with added by Harris hawks optimization (HHO), and its property is verified on 23 benchmarks. Then, the EBSO is utilized to perform parameter optimization and feature selection simultaneously for support vector machine (SVM), and the presented EBSO-SVM early recognition and discrimination of COVID-19 severity in terms of coagulation indexes using COVID-19 clinical data. The classification performance of the EBSO-SVM is very promising, reaching 91.9195% accuracy, 90.529% Matthews correlation coefficient, 90.9912% Sensitivity and 88.5705% Specificity on COVID-19. Compared with other existing state-of-the-art methods, the EBSO-SVM in this paper still shows obvious advantages in multiple metrics. The statistical results demonstrate that the proposed EBSO-SVM shows predictive properties for all metrics and higher stability, which can be treated as a computer-aided technique for analysis of COVID-19 severity from the perspective of coagulation.

Moth Flame Optimization: Theory, Modifications, Hybridizations, and Applications

The Moth flame optimization (MFO) algorithm belongs to the swarm intelligence family and is applied to solve complex real-world optimization problems in numerous domains. MFO and its variants are easy to understand and simple to operate. However, these algorithms have successfully solved optimization problems in different areas such as power and energy systems, engineering design, economic dispatch, image processing, and medical applications. A comprehensive review of MFO variants is presented in this context, including the classic version, binary types, modified versions, hybrid versions, multi-objective versions, and application part of the MFO algorithm in various sectors. Finally, the evaluation of the MFO algorithm is presented to measure its performance compared to other algorithms. The main focus of this literature is to present a survey and review the MFO and its applications. Also, the concluding remark section discusses some possible future research directions of the MFO algorithm and its variants.

GC-CNNnet: Diagnosis of Alzheimer’s Disease with PET Images Using Genetic and Convolutional Neural Network

There is a wide variety of effects of Alzheimer's disease (AD), a neurodegenerative disease that can lead to cognitive decline, deterioration of daily life, and behavioral and psychological changes. A polymorphism of the ApoE gene ε 4 is considered a genetic risk factor for Alzheimer's disease. The purpose of this paper is to demonstrate that single-nucleotide polymorphic markers (SNPs) have a causal relationship with quantitative PET imaging traits. Additionally, the classification of AD is based on the frequency of brain tissue variations in PET images using a combination of k-nearest-neighbor (KNN), support vector machine (SVM), linear discrimination analysis (LDA), and convolutional neural network (CNN) techniques. According to the results, the suggested SNPs appear to be associated with quantitative traits more strongly than the SNPs in the ApoE genes. Regarding the classification result, the highest accuracy is obtained by the CNN with 91.1%. These results indicate that the KNN and CNN methods are beneficial in diagnosing AD. Nevertheless, the LDA and SVM are demonstrated with a lower level of accuracy.

Boosted Sine Cosine Algorithm with Application to Medical Diagnosis

The sine cosine algorithm (SCA) was proposed for solving optimization tasks, of which the way to obtain the optimal solution is mainly through the continuous iteration of the sine and cosine update formulas. However, SCA also faces low population diversity and stagnation of locally optimal solutions. Hence, we try to eliminate these problems by proposing an enhanced version of SCA, named ESCA_PSO. ESCA_PSO is proposed based on hybrid SCA and particle swarm optimization (PSO) by incorporating multiple mutation strategies into the original SCA_PSO. To validate the effect of ESCA_PSO in handling global optimization problems, ESCA_PSO was compared with quality algorithms on various types of benchmark functions. In addition, the proposed ESCA_PSO was employed to tune the best parameters of support vector machines for dealing with medical diagnosis tasks. The results prove the efficiency of the proposed algorithms in solving optimization problems.

Tool for Predicting College Student Career Decisions: An Enhanced Support Vector Machine Framework

The goal of this research is to offer an effective intelligent model for forecasting college students’ career decisions in order to give a useful reference for career decisions and policy formation by relevant departments. The suggested prediction model is mainly based on a support vector machine (SVM) that has been modified using an enhanced butterfly optimization approach with a communication mechanism and Gaussian bare-bones mechanism (CBBOA). To get a better set of parameters and feature subsets, first, we added a communication mechanism to BOA to improve its global search capability and balance exploration and exploitation trends. Then, Gaussian bare-bones was added to increase the population diversity of BOA and its ability to jump out of the local optimum. The optimal SVM model (CBBOA-SVM) was then developed to predict the career decisions of college students based on the obtained parameters and feature subsets that are already optimized by CBBOA. In order to verify the effectiveness of CBBOA, we compared it with some advanced algorithms on all benchmark functions of CEC2014. Simulation results demonstrated that the performance of CBBOA is indeed more comprehensive. Meanwhile, comparisons between CBBOA-SVM and other machine learning approaches for career decision prediction were carried out, and the findings demonstrate that the provided CBBOA-SVM has better classification and more stable performance. As a result, it is plausible to conclude that the CBBOA-SVM is capable of being an effective tool for predicting college student career decisions.

An efficient rotational direction heap-based optimization with orthogonal structure for medical diagnosis

The heap-based optimizer (HBO) is an optimization method proposed in recent years that may face local stagnation problems and show slow convergence speed due to the lack of detailed analysis of optimal solutions and a comprehensive search. Therefore, to mitigate these drawbacks and strengthen the performance of the algorithm in the field of medical diagnosis, a new MGOHBO method is proposed by introducing the modified Rosenbrock's rotational direction method (MRM), an operator from the grey wolf optimizer (GWM), and an orthogonal learning strategy (OL). The MGOHBO is compared with eleven famous and improved optimizers on IEEE CEC 2017. The results on benchmark functions indicate that the boosted MGOHBO has several significant advantages in terms of convergence accuracy and speed of the process. Additionally, this article analyzed the diversity and balance of MGOHBO in detail. Finally, the proposed MGOHBO algorithm is utilized to optimize the kernel extreme learning machines (KELM), and a new MGOHBO-KELM is proposed. To validate the performance of MGOHBO-KELM, seven disease diagnostic questions were introduced for testing in this work. In contrast to advanced models such as HBO-KELM and BP, it can be concluded that the MGOHBO-KELM model can achieve optimal results, which also proves that it has practical significance in solving medical diagnosis problems.

Lupus nephritis diagnosis using enhanced moth flame algorithm with support vector machines

Systemic lupus erythematosus is a chronic autoimmune disease that affects the kidney in most patients. Lupus nephritis (LN) is divided into six categories by the International Society of Nephrology/Renal Pathology Society (ISN/RPS). The purpose of this research is to build a framework for discriminating between ISN/RPS pure class V(MLN) and classes III ± V or IV ± V (PLN) using real clinical data. The framework is developed by merging a hybrid stochastic optimizer, moth-flame algorithm (HMFO), with a support vector machine (SVM), dubbed HMFO-SVM. The HMFO is constructed by enhancing the original moth-flame algorithm (MFO) with a bee-foraging learning operator, which guarantees that the algorithm speeds convergence and departs from the local optimum. The HMFO is used to optimize parameters and select features simultaneously for SVM on clinical SLE data. On 23 benchmark tests, the suggested HMFO method is validated. Finally, clinical data from LN patients are analyzed to determine the efficacy of HMFO-SVM over other SVM rivals. The statistical findings indicate that all measures have predictive capabilities and that the suggested HMFO-SVM is more stable for analyzing systemic LN. HMFO-SVM may be used to analyze LN as a feasible computer-assisted technique.

Performance optimization of support vector machine with oppositional grasshopper optimization for acute appendicitis diagnosis

Preoperative differentiation of complicated and uncomplicated appendicitis is challenging. The research goal was to construct a new intelligent diagnostic rule that is accurate, fast, noninvasive, and cost-effective, distinguishing between complicated and uncomplicated appendicitis. Overall, 298 patients with acute appendicitis from the Wenzhou Central Hospital were recruited, and information on their demographic characteristics, clinical findings, and laboratory data was retrospectively reviewed and applied in this study. First, the most significant variables, including C-reactive protein (CRP), heart rate, body temperature, and neutrophils discriminating complicated from uncomplicated appendicitis, were identified using random forest analysis. Second, an improved grasshopper optimization algorithm-based support vector machine was used to construct the diagnostic model to discriminate complicated appendicitis (CAP) from uncomplicated appendicitis (UAP). The resultant optimal model can produce an average of 83.56% accuracy, 81.71% sensitivity, 85.33% specificity, and 0.6732 Matthews correlation coefficients. Based on existing routinely available markers, the proposed intelligent diagnosis model is highly reliable. Thus, the model can potentially be used to assist doctors in making correct clinical decisions.

Chaotic simulated annealing multi-verse optimization enhanced kernel extreme learning machine for medical diagnosis

Classification models such as Multi-Verse Optimization (MVO) play a vital role in disease diagnosis. To improve the efficiency and accuracy of MVO, in this paper, the defects of MVO are mitigated and the improved MVO is combined with kernel extreme learning machine (KELM) for effective disease diagnosis. Although MVO obtains some relatively good results on some problems of interest, it suffers from slow convergence speed and local optima entrapment for some many-sided basins, especially multi-modal problems with high dimensions. To solve these shortcomings, in this study, a new chaotic simulated annealing overhaul of MVO (CSAMVO) is proposed. Based on MVO, two approaches are adopted to offer a relatively stable and efficient convergence speed. Specifically, a chaotic intensification mechanism (CIP) is applied to the optimal universe evaluation stage to increase the depth of the universe search. After obtaining relatively satisfactory results, the simulated annealing algorithm (SA) is employed to reinforce the capability of MVO to avoid local optima. To evaluate its performance, the proposed CSAMVO approach was compared with a wide range of classical algorithms on thirty-nine benchmark functions. The results show that the improved MVO outperforms the other algorithms in terms of solution quality and convergence speed. Furthermore, based on CSAMVO, a hybrid KELM model termed CSAMVO-KELM is established for disease diagnosis. To evaluate its effectiveness, the new hybrid system was compared with a multitude of competitive classifiers on two disease diagnosis problems. The results demonstrate that the proposed CSAMVO-assisted classifier can find solutions with better learning potential and higher predictive performance.

Horizontal and vertical search artificial bee colony for image segmentation of COVID-19 X-ray images

The artificial bee colony algorithm (ABC) has been successfully applied to various optimization problems, but the algorithm still suffers from slow convergence and poor quality of optimal solutions in the optimization process. Therefore, in this paper, an improved ABC (CCABC) based on a horizontal search mechanism and a vertical search mechanism is proposed to improve the algorithm's performance. In addition, this paper also presents a multilevel thresholding image segmentation (MTIS) method based on CCABC to enhance the effectiveness of the multilevel thresholding image segmentation method. To verify the performance of the proposed CCABC algorithm and the performance of the improved image segmentation method. First, this paper demonstrates the performance of the CCABC algorithm itself by comparing CCABC with 15 algorithms of the same type using 30 benchmark functions. Then, this paper uses the improved multi-threshold segmentation method for the segmentation of COVID-19 X-ray images and compares it with other similar plans in detail. Finally, this paper confirms that the incorporation of CCABC in MTIS is very effective by analyzing appropriate evaluation criteria and affirms that the new MTIS method has a strong segmentation performance.

Detection of COVID-19 severity using blood gas analysis parameters and Harris hawks optimized extreme learning machine

Coronavirus disease-2019 (COVID-19) has made the world more cautious about widespread viruses, and a tragic pandemic that was caused by a novel coronavirus has harmed human beings in recent years. The new coronavirus pneumonia outbreak is spreading rapidly worldwide. We collect arterial blood samples from 51 patients with a COVID-19 diagnosis. Blood gas analysis is performed using a Siemens RAPID Point 500 blood gas analyzer. To accurately determine the factors that play a decisive role in the early recognition and discrimination of COVID-19 severity, a prediction framework that is based on an improved binary Harris hawk optimization (HHO) algorithm in combination with a kernel extreme learning machine is proposed in this paper. This method uses specular reflection learning to improve the original HHO algorithm and is referred to as HHOSRL. The experimental results show that the selected indicators, such as age, partial pressure of oxygen, oxygen saturation, sodium ion concentration, and lactic acid, are essential for the early accurate assessment of COVID-19 severity by the proposed feature selection method. The simulation results show that the established methodlogy can achieve promising performance. We believe that our proposed model provides an effective strategy for accurate early assessment of COVID-19 and distinguishing disease severity. The codes of HHO will be updated in https://aliasgharheidari.com/HHO.html.

MKELM: Mixed Kernel Extreme Learning Machine using BMDA optimization for web services based heart disease prediction in smart healthcare

In recent years, cardiovascular disease becomes a prominent source of death. The web services connect other medical equipments and the computers via internet for exchanging and combining the data in novel ways. The accurate prediction of heart disease is important to prevent cardiac patients prior to heart attack. The main drawback of heart disease is delay in identifying the disease in the early stage. This objective is obtained by using the machine learning method with rich healthcare information on heart diseases. In this paper, the smart healthcare method is proposed for the prediction of heart disease using Biogeography optimization algorithm and Mexican hat wavelet to enhance Dragonfly algorithm optimization with mixed kernel based extreme learning machine (BMDA-MKELM) approach. Here, data is gathered from the two devices such as sensor nodes as well as the electronic medical records. The android based design is utilized to gather the patient data and the reliable cloud-based scheme for the data storage. For further evaluation for the prediction of heart disease, data are gathered from cloud computing services. At last, BMDA-MKELM based prediction scheme is capable to classify cardiovascular diseases. In addition to this, the proposed prediction scheme is compared with another method with respect to measures such as accuracy, precision, specificity, and sensitivity. The experimental results depict that the proposed approach achieves better results for the prediction of heart disease when compared with other methods.

A Review of the Modification Strategies of the Nature Inspired Algorithms for Feature Selection Problem

This survey is an effort to provide a research repository and a useful reference for researchers to guide them when planning to develop new Nature-inspired Algorithms tailored to solve Feature Selection problems (NIAs-FS). We identified and performed a thorough literature review in three main streams of research lines: Feature selection problem, optimization algorithms, particularly, meta-heuristic algorithms, and modifications applied to NIAs to tackle the FS problem. We provide a detailed overview of 156 different articles about NIAs modifications for tackling FS. We support our discussions by analytical views, visualized statistics, applied examples, open-source software systems, and discuss open issues related to FS and NIAs. Finally, the survey summarizes the main foundations of NIAs-FS with approximately 34 different operators investigated. The most popular operator is chaotic maps. Hybridization is the most widely used modification technique. There are three types of hybridization: Integrating NIA with another NIA, integrating NIA with a classifier, and integrating NIA with a classifier. The most widely used hybridization is the one that integrates a classifier with the NIA. Microarray and medical applications are the dominated applications where most of the NIA-FS are modified and used. Despite the popularity of the NIAs-FS, there are still many areas that need further investigation.

Initialisation Approaches for Population-Based Metaheuristic Algorithms: A Comprehensive Review

A situation where the set of initial solutions lies near the position of the true optimality (most favourable or desirable solution) by chance can increase the probability of finding the true optimality and significantly reduce the search efforts. In optimisation problems, the location of the global optimum solution is unknown a priori, and initialisation is a stochastic process. In addition, the population size is equally important; if there are problems with high dimensions, a small population size may lie sparsely in unpromising regions, and may return suboptimal solutions with bias. In addition, the different distributions used as position vectors for the initial population may have different sampling emphasis; hence, different degrees of diversity. The initialisation control parameters of population-based metaheuristic algorithms play a significant role in improving the performance of the algorithms. Researchers have identified this significance, and they have put much effort into finding various distribution schemes that will enhance the diversity of the initial populations of the algorithms, and obtain the correct balance of the population size and number of iterations which will guarantee optimal solutions for a given problem set. Despite the affirmation of the role initialisation plays, to our knowledge few studies or surveys have been conducted on this subject area. Therefore, this paper presents a comprehensive survey of different initialisation schemes to improve the quality of solutions obtained by most metaheuristic optimisers for a given problem set. Popular schemes used to improve the diversity of the population can be categorised into random numbers, quasirandom sequences, chaos theory, probability distributions, hybrids of other heuristic or metaheuristic algorithms, Lévy, and others. We discuss the different levels of success of these schemes and identify their limitations. Similarly, we identify gaps and present useful insights for future research directions. Finally, we present a comparison of the effect of population size, the maximum number of iterations, and ten (10) different initialisation methods on the performance of three (3) population-based metaheuristic optimizers: bat algorithm (BA), Grey Wolf Optimizer (GWO), and butterfly optimization algorithm (BOA).

Individual Disturbance and Attraction Repulsion Strategy Enhanced Seagull Optimization for Engineering Design

The seagull optimization algorithm (SOA) is a novel swarm intelligence algorithm proposed in recent years. The algorithm has some defects in the search process. To overcome the problem of poor convergence accuracy and easy to fall into local optimality of seagull optimization algorithm, this paper proposed a new variant SOA based on individual disturbance (ID) and attraction-repulsion (AR) strategy, called IDARSOA, which employed ID to enhance the ability to jump out of local optimum and adopted AR to increase the diversity of population and make the exploration of solution space more efficient. The effectiveness of the IDARSOA has been verified using representative comprehensive benchmark functions and six practical engineering optimization problems. The experimental results show that the proposed IDARSOA has the advantages of better convergence accuracy and a strong optimization ability than the original SOA.