Boosted kernel search: Framework, analysis and case studies on the economic emission dispatch problem

An enhancing diagnostic pulmonary diseases diagnostic method for differentiating talaromycosis from tuberculosis

Talaromycosis (TSM) affects immunocompromised individuals, particularly those with human immunodeficiency virus (HIV)/acquired immunodeficiency syndrome (AIDS), causing varied pulmonary abnormalities on chest computed tomography (CT). These features overlap with pulmonary tuberculosis, making accurate differentiation essential for appropriate treatment. This study utilized real patient data from the First Affiliated Hospital of Wenzhou Medical University. A machine learning model, termed bIPCACO-FKNN, was developed, integrating an ant colony optimization (ACO) algorithm with a fuzzy k-nearest neighbors (FKNNs) classifier. This model introduces an incremental proportional-integral-derivative control strategy to enhance the search efficiency of ACO. Comparative analysis with several algorithms in the CEC 2017 benchmark functions confirms the superior performance of the IPCACO. Applying the bIPCACO-FKNN model for the prediction of pulmonary TSM achieved a prediction accuracy of 98.196% and a specificity of 99.500%, thus demonstrating its significant efficacy in accurately distinguishing between pulmonary TSM and tuberculosis. This provides an efficient and reliable machine learning tool for the differentiation between pulmonary TSM and tuberculosis.

Enhanced PSO feature selection with Runge-Kutta and Gaussian sampling for precise gastric cancer recurrence prediction

Gastric cancer (GC), characterized by its inconspicuous initial symptoms and rapid invasiveness, presents a formidable challenge. Overlooking postoperative intervention opportunities may result in the dissemination of tumors to adjacent areas and distant organs, thereby substantially diminishing prospects for patient survival. Consequently, the prompt recognition and management of GC postoperative recurrence emerge as a matter of paramount urgency to mitigate the deleterious implications of the ailment. This study proposes an enhanced feature selection model, bRSPSO-FKNN, integrating boosted particle swarm optimization (RSPSO) with fuzzy k-nearest neighbor (FKNN), for predicting GC. It incorporates the Runge-Kutta search, for improved model accuracy, and Gaussian sampling, enhancing the search performance and helping to avoid locally optimal solutions. It outperforms the sophisticated variants of particle swarm optimization when evaluated in the CEC 2014 test suite. Furthermore, the bRSPSO-FKNN feature selection model was introduced for GC recurrence prediction analysis, achieving up to 82.082 % and 86.185 % accuracy and specificity, respectively. In summation, this model attains a notable level of precision, poised to ameliorate the early warning system for GC recurrence and, in turn, advance therapeutic options for afflicted patients.

Ankylosing spondylitis prediction using fuzzy K-nearest neighbor classifier assisted by modified JAYA optimizer

The diagnosis of ankylosing spondylitis (AS) can be complex, necessitating a comprehensive assessment of medical history, clinical symptoms, and radiological evidence. This multidimensional approach can exacerbate the clinical burden and increase the likelihood of diagnostic inaccuracies, which may result in delayed or overlooked cases. Consequently, supplementary diagnostic techniques for AS have become a focal point in clinical research. This study introduces an enhanced optimization algorithm, SCJAYA, which incorporates salp swarm foraging behavior with cooperative predation strategies into the JAYA algorithm framework, noted for its robust optimization capabilities that emulate the evolutionary dynamics of biological organisms. The integration of salp swarm behavior is aimed at accelerating the convergence speed and enhancing the quality of solutions of the classical JAYA algorithm while the cooperative predation strategy is incorporated to mitigate the risk of convergence on local optima. SCJAYA has been evaluated across 30 benchmark functions from the CEC2014 suite against 9 conventional meta-heuristic algorithms as well as 9 state-of-the-art meta-heuristic counterparts. The comparative analyses indicate that SCJAYA surpasses these algorithms in terms of convergence speed and solution precision. Furthermore, we proposed the bSCJAYA-FKNN classifier: an advanced model applying the binary version of SCJAYA for feature selection, with the aim of improving the accuracy in diagnosing and prognosticating AS. The efficacy of the bSCJAYA-FKNN model was substantiated through validation on 11 UCI public datasets in addition to an AS-specific dataset. The model exhibited superior performance metrics-achieving an accuracy rate, specificity, Matthews correlation coefficient (MCC), F-measure, and computational time of 99.23 %, 99.52 %, 0.9906, 99.41 %, and 7.2800 s, respectively. These results not only underscore its profound capability in classification but also its substantial promise for the efficient diagnosis and prognosis of AS.

Predictive modeling for early detection of biliary atresia in infants with cholestasis: Insights from a machine learning study

Cholestasis, characterized by the obstruction of bile flow, poses a significant concern in neonates and infants. It can result in jaundice, inadequate weight gain, and liver dysfunction. However, distinguishing between biliary atresia (BA) and non-biliary atresia in these young patients presenting with cholestasis poses a formidable challenge, given the similarity in their clinical manifestations. To this end, our study endeavors to construct a screening model aimed at prognosticating outcomes in cases of BA. Within this study, we introduce a wrapper feature selection model denoted as bWFMVO-SVM-FS, which amalgamates the water flow-based multi-verse optimizer (WFMVO) and support vector machine (SVM) technology. Initially, WFMVO is benchmarked against eleven state-of-the-art algorithms, with its efficiency in searching for optimized feature subsets within the model validated on IEEE CEC 2017 and IEEE CEC 2022 benchmark functions. Subsequently, the developed bWFMVO-SVM-FS model is employed to analyze a cohort of 870 consecutively registered cases of neonates and infants with cholestasis (diagnosed as either BA or non-BA) from Xinhua Hospital and Shanghai Children's Hospital, both affiliated with Shanghai Jiao Tong University. The results underscore the remarkable predictive capacity of the model, achieving an accuracy of 92.639 % and specificity of 88.865 %. Gamma-glutamyl transferase, triangular cord sign, weight, abnormal gallbladder, and stool color emerge as highly correlated with early symptoms in BA infants. Furthermore, leveraging these five significant features enhances the interpretability of the machine learning model's performance outcomes for medical professionals, thereby facilitating more effective clinical decision-making.

Anticipating interpersonal sensitivity: A predictive model for early intervention in psychological disorders in college students

Psychological disorders, notably social anxiety and depression, exert detrimental effects on university students, impeding academic achievement and overall development. Timely identification of interpersonal sensitivity becomes imperative to implement targeted support and interventions. This study selected 958 freshmen from higher education institutions in Zhejiang province as the research sample. Utilizing the runge-kutta search and elite levy spreading enhanced moth-flame optimization (MFO) in conjunction with the kernel extreme learning machine (KELM), we propose an efficient intelligent prediction model, namely bREMFO-KELM, for predicting the interpersonal sensitivity of college students. IEEE CEC 2017 benchmark functions and the interpersonal sensitivity dataset were employed as the basis for detailed comparisons with peer-reviewed studies and well-known machine learning models. The experimental results demonstrate the outstanding performance of the bREMFO-KELM model in predicting the sensitivity of interpersonal relationships in college students, achieving an impressive accuracy rate of 97.186%. In-depth analysis reveals that the prediction of interpersonal sensitivity in college students is closely associated with multiple features, including easily hurt in relationships, shy and uneasy with the opposite sex, feeling inferior to others, discomfort when observed or discussed, and blame and criticize others. These features are not only crucial for the accuracy of the prediction model but also provide valuable information for a deeper understanding of the sensitivity of college students' interpersonal relationships. In conclusion, the bREMFO-KELM model excels not only in performance but also possesses a high degree of interpretability, providing robust support for predicting the sensitivity of interpersonal relationships in college students.

Parrot optimizer: Algorithm and applications to medical problems

Stochastic optimization methods have gained significant prominence as effective techniques in contemporary research, addressing complex optimization challenges efficiently. This paper introduces the Parrot Optimizer (PO), an efficient optimization method inspired by key behaviors observed in trained Pyrrhura Molinae parrots. The study features qualitative analysis and comprehensive experiments to showcase the distinct characteristics of the Parrot Optimizer in handling various optimization problems. Performance evaluation involves benchmarking the proposed PO on 35 functions, encompassing classical cases and problems from the IEEE CEC 2022 test sets, and comparing it with eight popular algorithms. The results vividly highlight the competitive advantages of the PO in terms of its exploratory and exploitative traits. Furthermore, parameter sensitivity experiments explore the adaptability of the proposed PO under varying configurations. The developed PO demonstrates effectiveness and superiority when applied to engineering design problems. To further extend the assessment to real-world applications, we included the application of PO to disease diagnosis and medical image segmentation problems, which are highly relevant and significant in the medical field. In conclusion, the findings substantiate that the PO is a promising and competitive algorithm, surpassing some existing algorithms in the literature. The supplementary files and open source codes of the proposed Parrot Optimizer (PO) is available at https://aliasgharheidari.com/PO.html and https://github.com/junbolian/PO.

Kernel extreme learning with harmonized bat algorithm for prediction of pyrene toxicity in rats

Polycyclic aromatic hydrocarbons (PAHs) are organic pollutants and manufactured substances conferring toxicity to human health. The present study investigated whether pyrene, a type of PAH, harms rats. Our research provides an effective feature selection strategy for the animal dataset from Wenzhou Medical University's Experimental Animal Center to thoroughly examine the impacts of PAH toxicity on rat features. Initially, we devised a high-performance optimization method (SCBA) and added the Sobol sequence, vertical crossover and horizontal crossover mechanisms to the bat algorithm (BA). The SCBA-KELM model, which combines SCBA with the kernel extreme learning machine model (KELM), has excellent accuracy and high stability for selecting features. Benchmark function tests are then used in this research to verify the overall optimization performance of SCBA. In this paper, the feature selection performance of SCBA-KELM is verified using various comparative experiments. According to the results, the features of the genes PXR, CAR, CYP2B1/2 and CYP1A1/2 have the most impact on rats. The SCBA-KELM model's classification performance for the gene dataset was 100%, and the model's precision value for the public dataset was around 96%, as determined by the classification index. In conclusion, the model utilized in this research is anticipated to be a reliable and valuable approach for toxicological classification and assessment.

Multi-threshold Image Segmentation based on an improved Salp Swarm Algorithm: Case study of breast cancer pathology images

Breast cancer poses a significant risk to women's health, and it is essential to provide proper diagnostic support. Medical image processing technology is a key component of all supporting diagnostic techniques, with Image Segmentation (IS) being one of its primary steps. Among various methods, Multilevel Image Segmentation (MIS) is considered one of the most effective and straightforward approaches. Many researchers have attempted to improve the quality of image segmentation by combining different metaheuristic algorithms with MIS. However, these methods often suffer from issues such as low convergence accuracy and a proclivity for converging towards Local Optima (LO). To overcome these challenges, this study introduces an integrated approach that combines the Salp Swarm Algorithm (SSA), Slime Mould Algorithm (SMA) and Differential Evolution (DE) algorithm. In this manuscript, we introduce an innovative hybrid MIS model termed SDSSA, which leverages elements from the SSA, SMA and DE algorithms. The SDSSA model fundamentally relies on non-local means 2D histogram and 2D Kapur's entropy. To evaluate the proposed method effectively, we compare it initially with similar algorithms using the IEEE CEC2014 benchmark functions. The SDSSA showcases enhanced convergence velocity and precision relative to similar algorithms. Furthermore, this paper proposes an excellent MIS method. Subsequently, IS experiments were conducted separately at both low and high threshold levels. The test results demonstrate that the segmentation outcomes of MIS, at both low and high threshold levels, outperform other methods. This validates SDSSA as a superior segmentation technique that provides practical assistance for future research in breast cancer pathology image processing.

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 Enhanced RIME Optimizer with Horizontal and Vertical Crossover for Discriminating Microseismic and Blasting Signals in Deep Mines

Real-time monitoring of rock stability during the mining process is critical. This paper first proposed a RIME algorithm (CCRIME) based on vertical and horizontal crossover search strategies to improve the quality of the solutions obtained by the RIME algorithm and further enhance its search capabilities. Then, by constructing a binary version of CCRIME, the key parameters of FKNN were optimized using a binary conversion method. Finally, a discrete CCRIME-based BCCRIME was developed, which uses an S-shaped function transformation approach to address the feature selection issue by converting the search result into a real number that can only be zero or one. The performance of CCRIME was examined in this study from various perspectives, utilizing 30 benchmark functions from IEEE CEC2017. Basic algorithm comparison tests and sophisticated variant algorithm comparison experiments were also carried out. In addition, this paper also used collected microseismic and blasting data for classification prediction to verify the ability of the BCCRIME-FKNN model to process real data. This paper provides new ideas and methods for real-time monitoring of rock mass stability during deep well mineral resource mining.

Advanced slime mould algorithm incorporating differential evolution and Powell mechanism for engineering design

The slime mould algorithm (SMA) is a population-based swarm intelligence optimization algorithm that simulates the oscillatory foraging behavior of slime moulds. To overcome its drawbacks of slow convergence speed and premature convergence, this paper proposes an improved algorithm named PSMADE, which integrates the differential evolution algorithm (DE) and the Powell mechanism. PSMADE utilizes crossover and mutation operations of DE to enhance individual diversity and improve global search capability. Additionally, it incorporates the Powell mechanism with a taboo table to strengthen local search and facilitate convergence toward better solutions. The performance of PSMADE is evaluated by comparing it with 14 metaheuristic algorithms (MA) and 15 improved MAs on the CEC 2014 benchmarks, as well as solving four constrained real-world engineering problems. Experimental results demonstrate that PSMADE effectively compensates for the limitations of SMA and exhibits outstanding performance in solving various complex problems, showing potential as an effective problem-solving tool.

Face Image Segmentation Using Boosted Grey Wolf Optimizer

Image segmentation methods have received widespread attention in face image recognition, which can divide each pixel in the image into different regions and effectively distinguish the face region from the background for further recognition. Threshold segmentation, a common image segmentation method, suffers from the problem that the computational complexity shows exponential growth with the increase in the segmentation threshold level. Therefore, in order to improve the segmentation quality and obtain the segmentation thresholds more efficiently, a multi-threshold image segmentation framework based on a meta-heuristic optimization technique combined with Kapur's entropy is proposed in this study. A meta-heuristic optimization method based on an improved grey wolf optimizer variant is proposed to optimize the 2D Kapur's entropy of the greyscale and nonlocal mean 2D histograms generated by image computation. In order to verify the advancement of the method, experiments compared with the state-of-the-art method on IEEE CEC2020 and face image segmentation public dataset were conducted in this paper. The proposed method has achieved better results than other methods in various tests at 18 thresholds with an average feature similarity of 0.8792, an average structural similarity of 0.8532, and an average peak signal-to-noise ratio of 24.9 dB. It can be used as an effective tool for face segmentation.

An enhanced decision-making framework for predicting future trends of sharing economy

This work aims to provide a reliable and intelligent prediction model for future trends in sharing economy. Moreover, it presents valuable insights for decision-making and policy development by relevant governmental bodies. Furthermore, the study introduces a predictive system that incorporates an enhanced Harris Hawk Optimization (HHO) algorithm and a K-Nearest Neighbor (KNN) forecasting framework. The method utilizes an improved simulated annealing mechanism and a Gaussian bare bone structure to improve the original HHO, termed SGHHO. To achieve optimal prediction performance and identify essential features, a refined simulated annealing mechanism is employed to mitigate the susceptibility of the original HHO algorithm to local optima. The algorithm employs a mechanism that boosts its global search ability by generating fresh solution sets at a specific likelihood. This mechanism dynamically adjusts the equilibrium between the exploration and exploitation phases, incorporating the Gaussian bare bone strategy. The best classification model (SGHHO-KNN) is developed to mine the key features with the improvement of both strategies. To assess the exceptional efficacy of the SGHHO algorithm, this investigation conducted a series of comparative trials employing the function set of IEEE CEC 2014. The outcomes of these experiments unequivocally demonstrate that the SGHHO algorithm outperforms the original HHO algorithm on 96.7% of the functions, substantiating its remarkable superiority. The algorithm can achieve the optimal value of the function on 67% of the tested functions and significantly outperforms other competing algorithms. In addition, the key features selected by the SGHHO-KNN model in the prediction experiment, including " Form of sharing economy in your region " and " Attitudes to the sharing economy ", are important for predicting the future trends of the sharing economy in this study. The results of the prediction demonstrate that the proposed model achieves an accuracy rate of 99.70% and a specificity rate of 99.38%. Consequently, the SGHHO-KNN model holds great potential as a reliable tool for forecasting the forthcoming trajectory of the sharing economy.

Anti-sine-cosine atom search optimization (ASCASO): a novel approach for parameter estimation of PV models

Nowadays, solar power generation has gradually become a part of electric energy sharing. How to effectively enhance the energy conversion efficiency of solar cells and components has gradually emerged as a focal point of research. This paper presents a boosted atomic search optimization (ASO) with a new anti-sine-cosine mechanism (ASCASO) to realize the parameter estimation of photovoltaic (PV) models. The anti-sine-cosine mechanism is inspired by the update principle of sine cosine algorithm (SCA) and the mutation strategy of linear population size reduction adaptive differential evolution (LSHADE). The working principle of anti-sine-cosine mechanism is to utilize two mutation formulas containing arcsine and arccosine functions to further update the position of atoms. The introduction of anti-sine-cosine mechanism achieves the populations' random handover and promotes the neighbors' information communication. For better evaluation, the proposed ASCASO is devoted to estimate parameters of three PV models of R.T.C France, one Photowat-PWP201 PV module model, and two commercial polycrystalline PV panels including STM6-40/36 and STM6-120/36 with monocrystalline cells. The proposed ASCASO is compared with nine reported comparative algorithms to assess the performance. The results of parameter estimation for different PV models of various methods demonstrate that ASCASO performs more accurately and reliably than other reported comparative methods. Thus, ASCASO can be considered a highly effective approach for accurately estimating the parameters of PV models.

Multi-threshold image segmentation using an enhanced fruit fly optimization for COVID-19 X-ray images

Since the outbreak of COVID-19, it has seriously endangered the health of human beings. Computer automatic segmentation of COVID-19 X-ray images is an important means to assist doctors in rapid and accurate diagnosis. Therefore, this paper proposes a modified FOA (EEFOA) with two optimization strategies added to the original FOA, including elite natural evolution (ENE) and elite random mutation (ERM). To be specific, ENE and ERM can effectively speed up the convergence and deal with the problem of local optima, respectively. The outstanding performance of EEFOA was confirmed by experimental results comparing EEFOA with the original FOA, other FOA variants, and advanced algorithms at CEC2014. After that, EEFOA is implemented for multi-threshold image segmentation (MIS) of COVID-19 X-ray images, where a 2D histogram consisting of the original greyscale image and the non-local means image is used to represent the image information, and Rényi's entropy is used as the objective function to find the maximum value. The evaluation results of the MIS segmentation experiments show that, whether high or low threshold, EEFOA can achieve higher quality segmentation results and greater robustness than other advanced segmentation methods.

Dispersed differential hunger games search for high dimensional gene data feature selection

The realms of modern medicine and biology have provided substantial data sets of genetic roots that exhibit a high dimensionality. Clinical practice and associated processes are primarily dependent on data-driven decision-making. However, the high dimensionality of the data in these domains increases the complexity and size of processing. It can be challenging to determine representative genes while reducing the data's dimensionality. A successful gene selection will serve to mitigate the computing costs and refine the accuracy of the classification by eliminating superfluous or duplicative features. To address this concern, this research suggests a wrapper gene selection approach based on the HGS, combined with a dispersed foraging strategy and a differential evolution strategy, to form a new algorithm named DDHGS. Introducing the DDHGS algorithm to the global optimization field and its binary derivative bDDHGS to the feature selection problem is anticipated to refine the existing search balance between explorative and exploitative cores. We assess and confirm the efficacy of our proposed method, DDHGS, by comparing it with DE and HGS combined with a single strategy, seven classic algorithms, and ten advanced algorithms on the IEEE CEC 2017 test suite. Furthermore, to further evaluate DDHGS' performance, we compare it with several CEC winners and DE-based techniques of great efficiency on 23 popular optimization functions and the IEEE CEC 2014 benchmark test suite. The experimentation asserted that the bDDHGS approach was able to surpass bHGS and a variety of existing methods when applied to fourteen feature selection datasets from the UCI repository. The metrics measured--classification accuracy, the number of selected features, fitness scores, and execution time--all showed marked improvements with the use of bDDHGS. Considering all results, it can be concluded that bDDHGS is an optimal optimizer and an effective feature selection tool in the wrapper mode.

An enhanced grey wolf optimizer boosted machine learning prediction model for patient-flow prediction

Large and medium-sized general hospitals have adopted artificial intelligence big data systems to optimize the management of medical resources to improve the quality of hospital outpatient services and decrease patient wait times in recent years as a result of the development of medical information technology and the rise of big medical data. However, owing to the impact of several elements, including the physical environment, patient, and physician behaviours, the real optimum treatment effect does not meet expectations. In order to promote orderly patient access, this work provides a patient-flow prediction model that takes into account shifting dynamics and objective rules of patient-flow to handle this issue and forecast patients' medical requirements. First, we propose a high-performance optimization method (SRXGWO) and integrate the Sobol sequence, Cauchy random replacement strategy, and directional mutation mechanism into the grey wolf optimization (GWO) algorithm. The patient-flow prediction model (SRXGWO-SVR) is then proposed using SRXGWO to optimize the parameters of support vector regression (SVR). Twelve high-performance algorithms are examined in the benchmark function experiments' ablation and peer algorithm comparison tests, which are intended to validate SRXGWO's optimization performance. In order to forecast independently in the patient-flow prediction trials, the data set is split into training and test sets. The findings demonstrated that SRXGWO-SVR outperformed the other seven peer models in terms of prediction accuracy and error. As a result, SRXGWO-SVR is anticipated to be a reliable and efficient patient-flow forecast system that may help hospitals manage medical resources as effectively as possible.

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.

An artificial bee bare-bone hunger games search for global optimization and high-dimensional feature selection

The domains of contemporary medicine and biology have generated substantial high-dimensional genetic data. Identifying representative genes and decreasing the dimensionality of the data can be challenging. The goal of gene selection is to minimize computing costs and enhance classification precision. Therefore, this article designs a new wrapper gene selection algorithm named artificial bee bare-bone hunger games search (ABHGS), which is the hunger games search (HGS) integrated with an artificial bee strategy and a Gaussian bare-bone structure to address this issue. To evaluate and validate the performance of our proposed method, ABHGS is compared to HGS and a single strategy embedded in HGS, six classic algorithms, and ten advanced algorithms on the CEC 2017 functions. The experimental results demonstrate that the bABHGS outperforms the original HGS. Compared to peers, it increases classification accuracy and decreases the number of selected features, indicating its actual engineering utility in spatial search and feature selection.

Renal Pathology Images Segmentation Based on Improved Cuckoo Search with Diffusion Mechanism and Adaptive Beta-Hill Climbing

Lupus Nephritis (LN) is a significant risk factor for morbidity and mortality in systemic lupus erythematosus, and nephropathology is still the gold standard for diagnosing LN. To assist pathologists in evaluating histopathological images of LN, a 2D Rényi entropy multi-threshold image segmentation method is proposed in this research to apply to LN images. This method is based on an improved Cuckoo Search (CS) algorithm that introduces a Diffusion Mechanism (DM) and an Adaptive β-Hill Climbing (AβHC) strategy called the DMCS algorithm. The DMCS algorithm is tested on 30 benchmark functions of the IEEE CEC2017 dataset. In addition, the DMCS-based multi-threshold image segmentation method is also used to segment renal pathological images. Experimental results show that adding these two strategies improves the DMCS algorithm's ability to find the optimal solution. According to the three image quality evaluation metrics: PSNR, FSIM, and SSIM, the proposed image segmentation method performs well in image segmentation experiments. Our research shows that the DMCS algorithm is a helpful image segmentation method for renal pathological images.

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.

An enhanced Runge Kutta boosted machine learning framework for medical diagnosis

With the development and maturity of machine learning methods, medical diagnosis aided with machine learning methods has become a popular method to assist doctors in diagnosing and treating patients. However, machine learning methods are greatly affected by their hyperparameters, for instance, the kernel parameter in kernel extreme learning machine (KELM) and the learning rate in residual neural networks (ResNet). If the hyperparameters are appropriately set, the performance of the classifier can be significantly improved. To boost the performance of the machine learning methods, this paper proposes to improve the Runge Kutta optimizer (RUN) to adaptively adjust the hyperparameters of the machine learning methods for medical diagnosis purposes. Although RUN has a solid mathematical theoretical foundation, there are still some performance defects when dealing with complex optimization problems. To remedy these defects, this paper proposes a new enhanced RUN method with a grey wolf mechanism and an orthogonal learning mechanism called GORUN. The superior performance of the GORUN was validated against other well-established optimizers on IEEE CEC 2017 benchmark functions. Then, the proposed GORUN is employed to optimize the machine learning models, including the KELM and ResNet, to construct robust models for medical diagnosis. The performance of the proposed machine learning framework was validated on several medical data sets, and the experimental results have demonstrated its superiority.

A grade-based search adaptive random slime mould optimizer for lupus nephritis image segmentation

The segmentation of medical images is a crucial and demanding step in medical image processing that offers a solid foundation for subsequent extraction and analysis of medical image data. Although multi-threshold image segmentation is the most used and specialized basic image segmentation technique, it is computationally demanding and often produces subpar segmentation results, hence restricting its application. To solve this issue, this work develops a multi-strategy-driven slime mould algorithm (RWGSMA) for multi-threshold image segmentation. Specifically, the random spare strategy, the double adaptive weigh strategy, and the grade-based search strategy are used to improve the performance of SMA, resulting in an enhanced SMA version. The random spare strategy is mainly used to accelerate the convergence rate of the algorithm. To prevent SMA from falling towards the local optimum, the double adaptive weights are also applied. The grade-based search approach has also been developed to boost convergence performance. This study evaluates the efficacy of RWGSMA from many viewpoints using 30 test suites from IEEE CEC2017 to effectively demonstrate the importance of these techniques in RWGSMA. In addition, numerous typical images were used to show RWGSMA's segmentation performance. Using the multi-threshold segmentation approach with 2D Kapur's entropy as the RWGSMA fitness function, the suggested algorithm was then used to segment instances of lupus nephritis. The experimental findings demonstrate that the suggested RWGSMA beats numerous similar rivals, suggesting that it has a great deal of promise for segmenting histopathological images.

An enhanced ant colony optimizer with Cauchy-Gaussian fusion and novel movement strategy for multi-threshold COVID-19 X-ray image segmentation

The novel coronavirus pneumonia (COVID-19) is a respiratory disease of great concern in terms of its dissemination and severity, for which X-ray imaging-based diagnosis is one of the effective complementary diagnostic methods. It is essential to be able to separate and identify lesions from their pathology images regardless of the computer-aided diagnosis techniques. Therefore, image segmentation in the pre-processing stage of COVID-19 pathology images would be more helpful for effective analysis. In this paper, to achieve highly effective pre-processing of COVID-19 pathological images by using multi-threshold image segmentation (MIS), an enhanced version of ant colony optimization for continuous domains (MGACO) is first proposed. In MGACO, not only a new move strategy is introduced, but also the Cauchy-Gaussian fusion strategy is incorporated. It has been accelerated in terms of convergence speed and has significantly enhanced its ability to jump out of the local optimum. Furthermore, an MIS method (MGACO-MIS) based on MGACO is developed, where it applies the non-local means, 2D histogram as the basis, and employs 2D Kapur’s entropy as the fitness function. To demonstrate the performance of MGACO, we qualitatively analyze it in detail and compare it with other peers on 30 benchmark functions from IEEE CEC2014, which proves that it has a stronger capability of solving problems over the original ant colony optimization for continuous domains. To verify the segmentation effect of MGACO-MIS, we conducted a comparison experiment with eight other similar segmentation methods based on real pathology images of COVID-19 at different threshold levels. The final evaluation and analysis results fully demonstrate that the developed MGACO-MIS is sufficient to obtain high-quality segmentation results in the COVID-19 image segmentation and has stronger adaptability to different threshold levels than other methods. Therefore, it has been well-proven that MGACO is an excellent swarm intelligence optimization algorithm, and MGACO-MIS is also an excellent segmentation method.

Boosted crow search algorithm for handling multi-threshold image problems with application to X-ray images of COVID-19

COVID-19 is pervasive and threatens the safety of people around the world. Therefore, now, a method is needed to diagnose COVID-19 accurately. The identification of COVID-19 by X-ray images is a common method. The target area is extracted from the X-ray images by image segmentation to improve classification efficiency and help doctors make a diagnosis. In this paper, we propose an improved crow search algorithm (CSA) based on variable neighborhood descent (VND) and information exchange mutation (IEM) strategies, called VMCSA. The original CSA quickly falls into the local optimum, and the possibility of finding the best solution is significantly reduced. Therefore, to help the algorithm avoid falling into local optimality and improve the global search capability of the algorithm, we introduce VND and IEM into CSA. Comparative experiments are conducted at CEC2014 and CEC'21 to demonstrate the better performance of the proposed algorithm in optimization. We also apply the proposed algorithm to multi-level thresholding image segmentation using Renyi's entropy as the objective function to find the optimal threshold, where we construct 2-D histograms with grayscale images and non-local mean images and maximize the Renyi's entropy on top of the 2-D histogram. The proposed segmentation method is evaluated on X-ray images of COVID-19 and compared with some algorithms. VMCSA has a significant advantage in segmentation results and obtains better robustness than other algorithms. The available extra info can be found at https://github.com/1234zsw/VMCSA.

A modified weighted mean of vectors optimizer for Chronic Kidney disease classification

Chronic kidney Disease (CKD), also known as chronic renal disease, is an illness that affects the majority of adults and is defined by a progressive decrease in kidney function over time, particularly in those with diabetes and high blood pressure. Metaheuristic (MH) algorithms based machine learning classifiers have become reliable for medical treatment. The weIghted meaN oF vectOrs (INFO) is a recently developed MH but suffers from a fall into local optimal and slow convergence speed. Therefore, to improve INFO, a modified INFO (mINFO) with two enhancement strategies has been developed. The developed variant utilizes the Opposition-Based Learning (OBL) to improve the local search ability to avoid trapping into the local optimum, and the Dynamic Candidate Solution (DCS) is used to overcome the premature convergence problem in INFO and achieve the appropriate balance between exploration and exploitation ability. The performance of the proposed mINFO based on the k-Nearest Neighbor (kNN) classifier is evaluated on the complex CEC'22 test suite and applied to predict Chronic Kidney Disease (CKD) on datasets extracted from UCI. The statistical results revealed the superiority of mINFO compared with several well-known MH algorithms, including the Harris Hawks Optimization (HHO), the Hunger Games Search (HGS) algorithm, the Moth-Flame Optimization (MFO) algorithm, the Whale Optimization Algorithm (WOA), the Sine Cosine Algorithm (SCA), the Gradient-Based Optimizer (GBO), and the original INFO algorithm. According to our knowledge, this paper is the first of its sort to try employing the proposed mINFO for solving the CEC'22 test suite. Furthermore, the experimental results of mINFO-kNN for classifying two CKD datasets demonstrated its superiority with an overall classification accuracy of 93.17% on two CKD datasets over other competitors.

Bioinformatics analysis of ferroptosis-related gene AKR1C3 as a potential biomarker of asthma and its identification in BEAS-2B cells

Ferroptosis is a newly discovered type of cell death and has recently been shown to be associated with asthma. However, the relationship between them at the genetic level has not been elucidated via informatics analysis. In this study, bioinformatics analyses are conducted using asthma and ferroptosis datasets to identify candidate ferroptosis-related genes using the R software. Weighted gene co-expression network analysis is performed to identify co-expressed genes. Protein-protein interaction networks, the Kyoto encyclopedia of genes and genomes, and gene ontology enrichment analysis are used to identify the potential functions of the candidate genes. We experimentally validate the results of our analysis using small interfering RNAs and plasmids to silence and upregulate the expression of the candidate gene in human bronchial epithelial cells (BEAS-2B). The ferroptosis signature levels are examined. Bioinformatics analysis of the asthma dataset GDS4896 shows that the level of the aldo-keto reductase family 1 member C3 (AKR1C3) gene in the peripheral blood of patients with severe therapy-resistant asthma and controlled persistent mild asthma (MA) is significantly upregulated. The AUC values for asthma diagnosis and MA are 0.823 and 0.915, respectively. The diagnostic value of AKR1C3 is verified using the GSE64913 dataset. The gene module of AKR1C3 is evident in MA and functions through redox reactions and metabolic processes. Ferroptosis indicators are downregulated by the overexpression of AKR1C3 and upregulated by silencing AKR1C3. The ferroptosis-related gene AKR1C3 can be used as a diagnostic biomarker for asthma, particularly for MA, and regulates ferroptosis in BEAS-2B cells.

The nonalcoholic fatty liver risk in prediction of unfavorable outcome after stroke: A nationwide registry analysis

Few researches have looked at the relationship between nonalcoholic fatty liver disease (NAFLD) at the time of admission and the long-term outcomes of patients suffering from acute ischemic stroke (AIS). We aimed to probe the relationship between NAFLD risk evaluated by NAFLD indices and long-term endpoints, along with the prognostic value of merging NAFLD indices with established risk markers for the prognosis of AIS patients. The fatty liver index (FLI) and the Hepatic steatosis index (HSI) were used to evaluate NAFLD risk in the Third China National Stroke Registry (CNSR-III), a large, prospective, national, multicenter cohort registry study. NAFLD was defined as FLI ≥35 for males and FLI ≥ 20 for females, as well as HSI>36. Death or major disability (modified Rankin Scale score ≥3) were the primary outcomes following the beginning of a stroke. On patient outcomes, the prognostic performance of two objective NAFLD parameters was evaluated. NAFLD was detected in 32.10-51.90% of AIS patients. After 1-year, 14.5% of the participants had died or suffered a severe outcome. After controlling for known risk factors, NAFLD was associated with a modest probability of adverse outcome (odds ratio,0.72[95% CI, 0.61-0.86] for FLI; odds ratio,0.68[95% CI, 0.55-0.85] for HSI). The inclusion of the two NAFLD indicators in the conventional prediction model was justified by the integrated discrimination index, continuing to increase the model's overall predictive value for long-term adverse outcomes. NAFLD risk was linked to a lower risk of long-term death or major disability in people with AIS. The predictive value of objective NAFLD after AIS was demonstrated in our study.

A Multi-strategy Improved Outpost and Differential Evolution Mutation Marine Predators Algorithm for Global Optimization

Marine Predators Algorithm (MPA) is a recent efficient metaheuristic algorithm that is enlightened by the biological behavior of ocean predators and prey. This algorithm simulates the Levy and Brownian movements of prevalent foraging strategy and has been applied to many complex optimization problems. However, the algorithm has defects such as a low diversity of the solutions, ease into the local optimal solutions, and decreasing convergence speed in dealing with complex problems. A modified version of this algorithm called ODMPA is proposed based on the tent map, the outpost mechanism, and the differential evolution mutation with simulated annealing (DE-SA) mechanism. The tent map and DE-SA mechanism are added to enhance the exploration capability of MPA by increasing the diversity of the search agents, and the outpost mechanism is mainly used to improve the convergence speed of MPA. To validate the outstanding performance of the ODMPA, a series of global optimization problems are selected as the test sets, including the standard IEEE CEC2014 benchmark functions, which are the authoritative test set, three well-known engineering problems, and photovoltaic model parameters tasks. Compared with some famous algorithms, the results reveal that ODMPA has achieved better performance than its counterparts in CEC2014 benchmark functions. And in solving real-world optimization problems, ODMPA could get higher accuracy than other metaheuristic algorithms. These practical results demonstrate that the mechanisms introduced positively affect the original MPA, and the proposed ODMPA can be a widely effective tool in tackling many optimization problems.

An enhanced deep deterministic policy gradient algorithm for intelligent control of robotic arms

Aiming at the poor robustness and adaptability of traditional control methods for different situations, the deep deterministic policy gradient (DDPG) algorithm is improved by designing a hybrid function that includes different rewards superimposed on each other. In addition, the experience replay mechanism of DDPG is also improved by combining priority sampling and uniform sampling to accelerate the DDPG's convergence. Finally, it is verified in the simulation environment that the improved DDPG algorithm can achieve accurate control of the robot arm motion. The experimental results show that the improved DDPG algorithm can converge in a shorter time, and the average success rate in the robotic arm end-reaching task is as high as 91.27%. Compared with the original DDPG algorithm, it has more robust environmental adaptability.

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.

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.

Intradialytic hypotension prediction using covariance matrix-driven whale optimizer with orthogonal structure-assisted extreme learning machine

Intradialytic hypotension (IDH) is an adverse event occurred during hemodialysis (HD) sessions with high morbidity and mortality. The key to preventing IDH is predicting its pre-dialysis and administering a proper ultrafiltration prescription. For this purpose, this paper builds a prediction model (bCOWOA-KELM) to predict IDH using indices of blood routine tests. In the study, the orthogonal learning mechanism is applied to the first half of the WOA to improve the search speed and accuracy. The covariance matrix is applied to the second half of the WOA to enhance the ability to get out of local optimum and convergence accuracy. Combining the above two improvement methods, this paper proposes a novel improvement variant (COWOA) for the first time. More, the core of bCOWOA-KELM is that the binary COWOA is utilized to improve the performance of the KELM. In order to verify the comprehensive performance of the study, the paper sets four types of comparison experiments for COWOA based on 30 benchmark functions and a series of prediction experiments for bCOWOA-KELM based on six public datasets and the HD dataset. Finally, the results of the experiments are analyzed separately in this paper. The results of the comparison experiments prove fully that the COWOA is superior to other famous methods. More importantly, the bCOWOA performs better than its peers in feature selection and its accuracy is 92.41%. In addition, bCOWOA improves the accuracy by 0.32% over the second-ranked bSCA and by 3.63% over the worst-ranked bGWO. Therefore, the proposed model can be used for IDH prediction with future applications.

Boosting Slime Mould Algorithm for High-Dimensional Gene Data Mining: Diversity Analysis and Feature Selection

Slime mould algorithm (SMA) is a new metaheuristic algorithm, which simulates the behavior and morphology changes of slime mould during foraging. The slime mould algorithm has good performance; however, the basic version of SMA still has some problems. When faced with some complex problems, it may fall into local optimum and cannot find the optimal solution. Aiming at this problem, an improved SMA is proposed to alleviate the disadvantages of SMA. Based on the original SMA, Gaussian mutation and Levy flight are introduced to improve the global search performance of the SMA. Adding Gaussian mutation to SMA can improve the diversity of the population, and Levy flight can alleviate the local optimum of SMA, so that the algorithm can find the optimal solution as soon as possible. In order to verify the effectiveness of the proposed algorithm, a continuous version of the proposed algorithm, GLSMA, is tested on 33 classical continuous optimization problems. Then, on 14 high-dimensional gene datasets, the effectiveness of the proposed discrete version, namely, BGLSMA, is verified by comparing with other feature selection algorithm. Experimental results reveal that the performance of the continuous version of the algorithm is better than the original algorithm, and the defects of the original algorithm are alleviated. Besides, the discrete version of the algorithm has a higher classification accuracy when fewer features are selected. This proves that the improved algorithm has practical value in high-dimensional gene feature selection.

Mutational Slime Mould Algorithm for Gene Selection

A large volume of high-dimensional genetic data has been produced in modern medicine and biology fields. Data-driven decision-making is particularly crucial to clinical practice and relevant procedures. However, high-dimensional data in these fields increase the processing complexity and scale. Identifying representative genes and reducing the data's dimensions is often challenging. The purpose of gene selection is to eliminate irrelevant or redundant features to reduce the computational cost and improve classification accuracy. The wrapper gene selection model is based on a feature set, which can reduce the number of features and improve classification accuracy. This paper proposes a wrapper gene selection method based on the slime mould algorithm (SMA) to solve this problem. SMA is a new algorithm with a lot of application space in the feature selection field. This paper improves the original SMA by combining the Cauchy mutation mechanism with the crossover mutation strategy based on differential evolution (DE). Then, the transfer function converts the continuous optimizer into a binary version to solve the gene selection problem. Firstly, the continuous version of the method, ISMA, is tested on 33 classical continuous optimization problems. Then, the effect of the discrete version, or BISMA, was thoroughly studied by comparing it with other gene selection methods on 14 gene expression datasets. Experimental results show that the continuous version of the algorithm achieves an optimal balance between local exploitation and global search capabilities, and the discrete version of the algorithm has the highest accuracy when selecting the least number of genes.

Predicting Entrepreneurial Intention of Students: Kernel Extreme Learning Machine with Boosted Crow Search Algorithm

College students are the group with the most entrepreneurial vitality and potential. How to cultivate their entrepreneurial and innovative ability is one of the important and urgent issues facing this current social development. This paper proposes a reliable, intelligent prediction model of entrepreneurial intentions, providing theoretical support for guiding college students’ positive entrepreneurial intentions. The model mainly uses the improved crow search algorithm (CSA) to optimize the kernel extreme learning machine (KELM) model with feature selection (FS), namely CSA-KELM-FS, to study entrepreneurial intention. To obtain the best fitting model and key features, the gradient search rule, local escaping operator, and levy flight mutation (GLL) mechanism are introduced to enhance the CSA (GLLCSA), and FS is used to extract the key features. To verify the performance of the proposed GLLCSA, it is compared with eight other state-of-the-art methods. Further, the GLLCSA-KELM-FS model and five other machine learning methods have been used to predict the entrepreneurial intentions of 842 students from the Wenzhou Vocational College in Zhejiang, China, in the past five years. The results show that the proposed model can correctly predict the students’ entrepreneurial intention with an accuracy rate of 93.2% and excellent stability. According to the prediction results of the proposed model, the key factors affecting the student’s entrepreneurial intention are mainly the major studied, campus innovation, entrepreneurship practice experience, and positive personality. Therefore, the proposed GLLCSA-KELM-FS is expected to be an effective tool for predicting students’ entrepreneurial intentions.

Multilevel threshold image segmentation for COVID-19 chest radiography: A framework using horizontal and vertical multiverse optimization

COVID-19 is currently raging worldwide, with more patients being diagnosed every day. It usually is diagnosed by examining pathological photographs of the patient's lungs. There is a lot of detailed and essential information on chest radiographs, but manual processing is not as efficient or accurate. As a result, how efficiently analyzing and processing chest radiography of COVID-19 patients is an important research direction to promote COVID-19 diagnosis. To improve the processing efficiency of COVID-19 chest films, a multilevel thresholding image segmentation (MTIS) method based on an enhanced multiverse optimizer (CCMVO) is proposed. CCMVO is improved from the original Multi-Verse Optimizer by introducing horizontal and vertical search mechanisms. It has a more assertive global search ability and can jump out of the local optimum in optimization. The CCMVO-based MTIS method can obtain higher quality segmentation results than HHO, SCA, and other forms and is less prone to stagnation during the segmentation process. To verify the performance of the proposed CCMVO algorithm, CCMVO is first compared with DE, MVO, and other algorithms by 30 benchmark functions; then, the proposed CCMVO is applied to image segmentation of COVID-19 chest radiography; finally, this paper verifies that the combination of MTIS and CCMVO is very successful with good segmentation results by using the Feature Similarity Index (FSIM), the Peak Signal to Noise Ratio (PSNR), and the Structural Similarity Index (SSIM). Therefore, this research can provide an effective segmentation method for a medical organization to process COVID-19 chest radiography and then help doctors diagnose coronavirus pneumonia (COVID-19).

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.

Random Replacement Crisscross Butterfly Optimization Algorithm for Standard Evaluation of Overseas Chinese Associations

The butterfly optimization algorithm (BOA) is a swarm intelligence optimization algorithm proposed in 2019 that simulates the foraging behavior of butterflies. Similarly, the BOA itself has certain shortcomings, such as a slow convergence speed and low solution accuracy. To cope with these problems, two strategies are introduced to improve the performance of BOA. One is the random replacement strategy, which involves replacing the position of the current solution with that of the optimal solution and is used to increase the convergence speed. The other is the crisscross search strategy, which is utilized to trade off the capability of exploration and exploitation in BOA to remove local dilemmas whenever possible. In this case, we propose a novel optimizer named the random replacement crisscross butterfly optimization algorithm (RCCBOA). In order to evaluate the performance of RCCBOA, comparative experiments are conducted with another nine advanced algorithms on the IEEE CEC2014 function test set. Furthermore, RCCBOA is combined with support vector machine (SVM) and feature selection (FS)—namely, RCCBOA-SVM-FS—to attain a standardized construction model of overseas Chinese associations. It is found that the reasonableness of bylaws; the regularity of general meetings; and the right to elect, be elected, and vote are of importance to the planning and standardization of Chinese associations. Compared with other machine learning methods, the RCCBOA-SVM-FS model has an up to 95% accuracy when dealing with the normative prediction problem of overseas Chinese associations. Therefore, the constructed model is helpful for guiding the orderly and healthy development of overseas Chinese associations.

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.