Search

[Display omitted] • An improved Harris hawks optimization (EHHO) is proposed to deal with feature selection task. • By adding the hierarchy mechanism, the algorithm can achieve better convergence speed and accuracy. • EHHO performed well on classic test sets of CEC. • EHHO can obtain better performance than the original HHO with less features. 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. 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. 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. 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. Compared with the original bHHO, bEHHO can achieve excellent classification accuracy with fewer features and is also better than bHHO in running time. [ABSTRACT FROM AUTHOR]

• An advanced shuffled frog leaping algorithm (DSSRLFLA) is developed for model evaluation and feature selection. • A dynamic step size adjustment strategy based on historical information is designed to balance exploration and exploitation. • Specular reflection learning mechanism increases the possibility of searching for valid solutions and enhances the search ability. • An improved simulated annealing strategy is executed for each memetic to improve the efficiency of local exploitation. • DSSRLFLA can obtain higher quality optimal solutions compared to some competitive algorithms. The shuffled frog leaping algorithm is a new optimization algorithm proposed to solve the combinatorial optimization problem, which effectively combines the memetic algorithm based on a memetic algorithm and the particle swarm algorithm based on population behavior. The algorithm is widely used because it is easy to implement and requires few parameters to be adjusted. However, there are still some characteristics of this method that need to be improved because it is easy to fall into local optimization or poor search ability. To alleviate this limitation, a new version of the improved SFLA is proposed in this paper, which incorporates a dynamic step size adjustment strategy based on historical information, a specular reflection learning mechanism, and a simulated annealing mechanism based on chaotic mapping and levy flight. Firstly, the dynamic step size adjustment strategy based on historical information effectively helps to balance local exploration and global exploitation and alleviates the problem of falling into local optimum. Second, the specular reflection learning mechanism increases the possibility of searching for valid solutions in feasible domains and enhances the search ability of individuals in the population. Finally, an improved simulated annealing strategy is executed for each memetic, which improves the efficiency of local exploitation. In order to test the performance of the proposed algorithm, 31 test functions were selected from IEEE CEC2014 and 23 essential benchmark functions, and comparative experiments were carried out from the two dimensions of 30 and 100. Furthermore, a series of competing algorithms are selected, which involve nine classical standard algorithms, including PSO, BA, SSA, FA, SCA, WOA, GWO, MFO, and SFLA, as well as, six well-known improved algorithms, including LSFLA, DDSFLA, GOTLBO, ALCPSO, BLPSO, CLPSO. Furthermore, Wilcoxon signed-rank test and Friedman test are used as testing tools to illustrate the scalability of the proposed algorithm. From the analysis of the results, it can be seen that this proposed method has been effectively improved concerning stability and the quality of the optimal solution obtained from the search, both in low and high dimensions, and the ability to jump out of the local optimum has also been enhanced. In addition, to prove that this method has a reliable performance in discrete problems and continuous problems, DSSRLFLA is mapped into a discrete space, and 24 UCI data sets are also selected to evaluate the performance of the new feature selection method. The experimental results illustrate that this improved method can obtain fewer features and higher classification accuracy than some well-known feature selection methods. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Tuberculous pleural effusion poses a significant threat to human health due to its potential for severe disease and mortality. Without timely treatment, it may lead to fatal consequences. Therefore, early identification and prompt treatment are crucial for preventing problems such as chronic lung disease, respiratory failure, and death. This study proposes an enhanced differential evolution algorithm based on colony predation and dispersed foraging strategies. A series of experiments conducted on the IEEE CEC 2017 competition dataset validated the global optimization capability of the method. Additionally, a binary version of the algorithm is introduced to assess the algorithm's ability to address feature selection problems. Comprehensive comparisons of the effectiveness of the proposed algorithm with 8 similar algorithms were conducted using public datasets with feature sizes ranging from 10 to 10,000. Experimental results demonstrate that the proposed method is an effective feature selection approach. Furthermore, a predictive model for tuberculous pleural effusion is established by integrating the proposed algorithm with support vector machines. The performance of the proposed model is validated using clinical records collected from 140 tuberculous pleural effusion patients, totaling 10,780 instances. Experimental results indicate that the proposed model can identify key correlated indicators such as pleural effusion adenosine deaminase, temperature, white blood cell count, and pleural effusion color, aiding in the clinical feature analysis of tuberculous pleural effusion and providing early warning for its treatment and prediction. • The CFDE is designed and verified on benchmarks. • The binary version of CFDE (bCFDE) is designed for TBPE. • The bCFDE is verified on 24 datasets and compared to other peers. • The bCFDE-SVM is applied to TBPE successfully. [ABSTRACT FROM AUTHOR]

Background and Objective: In countries with high prevalence of tuberculosis (TB), clinicians often diagnose tuberculous pleural effusion (TPE) by using diagnostic tests, which have not only poor sensitivity, but poor availability as well. The aim of our study is to develop a new artificial intelligence based diagnostic model that is accurate, fast, non-invasive and cost effective to diagnose TPE. It is expected that a tool derived based on the model be installed on simple computer devices (such as smart phones and tablets) and be used by clinicians widely. Methods: For this study, data of 140 patients whose clinical signs, routine blood test results, blood biochemistry markers, pleural fluid cell type and count, and pleural fluid biochemical tests’ results were prospectively collected into a database. An Artificial intelligence based diagnostic model, which employs moth flame optimization based support vector machine with feature selection (FS-MFO-SVM), is constructed to predict the diagnosis of TPE. Results: The optimal model results in an average of 95% accuracy (ACC), 0.9564 the area under the receiver operating characteristic curve (AUC), 93.35% sensitivity, and 97.57% specificity for FS-MFO-SVM. Conclusions: The proposed artificial intelligence based diagnostic model is found to be highly reliable for diagnosing TPE based on simple clinical signs, blood samples and pleural effusion samples. Therefore, the proposed model can be widely used in clinical practice and further evaluated for use as a substitute of invasive pleural biopsies. [ABSTRACT FROM AUTHOR]

This study proposes a novel learning scheme for the kernel extreme learning machine ( KELM ) based on the chaotic moth-flame optimization ( CMFO ) strategy. In the proposed scheme, CMFO simultaneously performs parameter optimization and feature selection. The proposed methodology is rigorously compared to several other competitive KELM models that are based on the original moth-flame optimization, particle swarm optimization, and genetic algorithms. The comparison is made using the medical diagnosis problems of Parkinson's disease and breast cancer. And the proposed method has successfully been applied to practical medical diagnosis cases. The experimental results demonstrate that, compared to the alternative methods, the proposed method offers significantly better classification performance and also obtains a smaller feature subset. Promisingly, the proposed CMFOFS - KELM , can serve as an effective and efficient computer aided tool for medical diagnosis in the field of medical decision making. [ABSTRACT FROM AUTHOR]

Background and objectives It is important to be able to accurately distinguish between benign and malignant thyroid nodules in order to make appropriate clinical decisions. The purpose of this study was to improve the effectiveness and efficiency for discriminating the malignant from benign thyroid cancers based on the Ultrasonography (US) features. Methods There were 114 benign nodules in 106 patients (82 women and 24 men) and 89 malignant nodules in 81 patients (69 women and 12 men) included in this study. The potential of extreme learning machine (ELM) has been explored for the first time to discriminate malignant and benign thyroid nodules based on the sonographic features in ultrasound images. The influence of two key parameters (the number of hidden neurons and type of activation function) on the performance of ELM was investigated. The relationship between feature subsets obtained by the feature selection method and the classification performance of ELM was also examined. A real-life dataset was used to evaluate the effectiveness of the proposed method in terms of classification accuracy, sensitivity, specificity, and area under the ROC (receiver operating characteristic) curve (AUC). Results The results demonstrate that there are significant differences between the malignant and benign thyroid nodules (p-value<0.01), the most discriminative features are echogenicity, calcification, margin, composition and shape. Compared with other methods, the proposed method not only has achieved very promising classification accuracy via 10-fold cross-validation (CV) scheme, but also greatly reduced the computational cost compared to other counterparts. The proposed ELM-based approach achieves 87.72% ACC, 0.8672 AUC, 78.89% sensitivity, and 94.55% specificity. Conclusions Based on the empirical analysis, the proposed ELM-based approach for thyroid cancer detection has promising potential in clinical use, and it can be of assistance as an optional tool for the clinicians. [ABSTRACT FROM AUTHOR]

The slime mould algorithm (SMA) is a logical swarm-based stochastic optimizer that is easy to understand and has a strong optimization capability. However, the SMA is not suitable for solving multimodal and hybrid functions. Therefore, in the present study, to enhance the SMA and maintain population diversity, a dispersed foraging SMA (DFSMA) with a dispersed foraging strategy is proposed. We conducted extensive experiments based on several functions in IEEE CEC2017. The DFSMA were compared with 11 other meta-heuristic algorithms (MAs), 10 advanced algorithms, and 3 recently proposed algorithms. Moreover, to conduct more systematic data analyses, the experimental results were further evaluated using the Wilcoxon signed-rank test. The DFSMA was shown to outperform other optimizers in terms of convergence speed and accuracy. In addition, the binary DFSMA (BDFSMA) was obtained using the transform function. The performance of the BDFSMA was evaluated on 12 datasets in the UCI repository. The experimental results reveal that the BDFSMA performs better than the original SMA, and that, compared with other optimization algorithms, it improves classification accuracy and reduces the number of selected features, demonstrating its practical engineering value in spatial search and feature selection. • An improved slime mould algorithm (DFSMA) is proposed for feature selection. • The performance of DFSMA is verified by comparing with several famous algorithms. • DFSMA has faster convergence speed and accuracy compared with others. • DFSMA has achieved higher classification accuracy and smaller number of features. [ABSTRACT FROM AUTHOR]