Enhancing gastric cancer early detection: A multi-verse optimized feature selection model with crossover-information feedback

Gastric cancer (GC), an acknowledged malignant neoplasm, threatens life and digestive system functionality if not detected and addressed promptly in its nascent stages. The indispensability of early detection for GC to augment treatment efficacy and survival prospects forms the crux of this investigation. Our study introduces an innovative wrapper-based feature selection methodology, referred to as bCIFMVO-FKNN-FS, which integrates a crossover-information feedback multi-verse optimizer (CIFMVO) with the fuzzy k-nearest neighbors (FKNN) classifier. The primary goal of this initiative is to develop an advanced screening model designed to accelerate the identification of patients with early-stage GC. Initially, the capability of CIFMVO is validated through its application to the IEEE CEC benchmark functions, during which its optimization efficiency is measured against eleven cutting-edge algorithms across various dimensionalities-10, 30, 50, and 100. Subsequent application of the bCIFMVO-FKNN-FS model to the clinical data of 1632 individuals from Wenzhou Central Hospital-diagnosed with either early-stage GC or chronic gastritis-demonstrates the model's formidable predictive accuracy (83.395%) and sensitivity (87.538%). Concurrently, this investigation delineates age, gender, serum gastrin-17, serum pepsinogen I, and the serum pepsinogen I to serum pepsinogen II ratio as parameters significantly associated with early-stage GC. These insights not only validate the efficacy of our proposed model in the early screening of GC but also contribute substantively to the corpus of knowledge facilitating early diagnosis.

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.

A novel multi-strategy ameliorated quasi-oppositional chaotic tunicate swarm algorithm for global optimization and constrained engineering applications

Over the last few decades, a number of prominent meta-heuristic algorithms have been put forth to address complex optimization problems. However, there is a critical need to enhance these existing meta-heuristics by employing a variety of evolutionary techniques to tackle the emerging challenges in engineering applications. As a result, this study attempts to boost the efficiency of the recently introduced bio-inspired algorithm, the Tunicate Swarm Algorithm (TSA), which is motivated by the foraging and swarming behaviour of bioluminescent tunicates residing in the deep sea. Like other algorithms, the TSA has certain limitations, including getting trapped in the local optimal values and a lack of exploration ability, resulting in premature convergence when dealing with highly challenging optimization problems. To overcome these shortcomings, a novel multi-strategy ameliorated TSA, termed the Quasi-Oppositional Chaotic TSA (QOCTSA), has been proposed as an enhanced variant of TSA. This enhanced method contributes the simultaneous incorporation of the Quasi-Oppositional Based Learning (QOBL) and Chaotic Local Search (CLS) mechanisms to effectively balance exploration and exploitation. The implementation of QOBL improves convergence accuracy and exploration rate, while the inclusion of a CLS strategy with ten chaotic maps improves exploitation by enhancing local search ability around the most prospective regions. Thus, the QOCTSA significantly enhances convergence accuracy while maintaining TSA diversification. The experimentations are conducted on a set of thirty-three diverse functions: CEC2005 and CEC2019 test functions, as well as several real-world engineering problems. The statistical and graphical outcomes indicate that QOCTSA is superior to TSA and exhibits a faster rate of convergence. Furthermore, the statistical tests, specifically the Wilcoxon rank-sum test and t-test, reveal that the QOCTSA method outperforms the other competing algorithms in the domain of real-world engineering design problems.

Optimized fuzzy K-nearest neighbor approach for accurate lung cancer prediction based on radial endobronchial ultrasonography

Radial endobronchial ultrasonography (R-EBUS) has been a surge in the development of new ultrasonography for the diagnosis of pulmonary diseases beyond the central airway. However, it faces challenges in accurately pinpointing the location of abnormal lesions. Therefore, this study proposes an improved machine learning model aimed at distinguishing between malignant lung disease (MLD) from benign lung disease (BLD) through R-EBUS features. An enhanced manta ray foraging optimization based on elite perturbation search and cyclic mutation strategy (ECMRFO) is introduced at first. Experimental validation on 29 test functions from CEC 2017 demonstrates that ECMRFO exhibits superior optimization capabilities and robustness compared to other competing algorithms. Subsequently, it was combined with fuzzy k-nearest neighbor for the classification prediction of BLD and MLD. Experimental results indicate that the proposed modal achieves a remarkable prediction accuracy of up to 99.38%. Additionally, parameters such as R-EBUS1 Circle-dense sign, R-EBUS2 Hemi-dense sign, R-EBUS5 Onionskin sign and CCT5 mediastinum lymph node are identified as having significant clinical diagnostic value.

Benign and malignant classification of breast tumor ultrasound images using conventional radiomics and transfer learning features: A multicenter retrospective study

This study aims to establish an effective benign and malignant classification model for breast tumor ultrasound images by using conventional radiomics and transfer learning features. We collaborated with a local hospital and collected a base dataset (Dataset A) consisting of 1050 cases of single lesion 2D ultrasound images from patients, with a total of 593 benign and 357 malignant tumor cases. The experimental approach comprises three main parts: conventional radiomics, transfer learning, and feature fusion. Furthermore, we assessed the model's generalizability by utilizing multicenter data obtained from Datasets B and C. The results from conventional radiomics indicated that the SVM classifier achieved the highest balanced accuracy of 0.791, while XGBoost obtained the highest AUC of 0.854. For transfer learning, we extracted deep features from ResNet50, Inception-v3, DenseNet121, MNASNet, and MobileNet. Among these models, MNASNet, with 640-dimensional deep features, yielded the optimal performance, with a balanced accuracy of 0.866, AUC of 0.937, sensitivity of 0.819, and specificity of 0.913. In the feature fusion phase, we trained SVM, ExtraTrees, XGBoost, and LightGBM with early fusion features and evaluated them with weighted voting. This approach achieved the highest balanced accuracy of 0.964 and AUC of 0.981. Combining conventional radiomics and transfer learning features demonstrated clear advantages over using individual features for breast tumor ultrasound image classification. This automated diagnostic model can ease patient burden and provide additional diagnostic support to radiologists. The performance of this model encourages future prospective research in this domain.

CDRIME-MTIS: An enhanced rime optimization-driven multi-threshold segmentation for COVID-19 X-ray images

To improve the detection of COVID-19, this paper researches and proposes an effective swarm intelligence algorithm-driven multi-threshold image segmentation (MTIS) method. First, this paper proposes a novel RIME structure integrating the Co-adaptive hunting and dispersed foraging strategies, called CDRIME. Specifically, the Co-adaptive hunting strategy works in coordination with the basic search rules of RIME at the individual level, which not only facilitates the algorithm to explore the global optimal solution but also enriches the population diversity to a certain extent. The dispersed foraging strategy further enriches the population diversity to help the algorithm break the limitation of local search and thus obtain better convergence. Then, on this basis, a new multi-threshold image segmentation method is proposed by combining the 2D non-local histogram with 2D Kapur entropy, called CDRIME-MTIS. Finally, the results of experiments based on IEEE CEC2017, IEEE CEC2019, and IEEE CEC2022 demonstrate that CDRIME has superior performance than some other basic, advanced, and state-of-the-art algorithms in terms of global search, convergence performance, and escape from local optimality. Meanwhile, the segmentation experiments on COVID-19 X-ray images demonstrate that CDRIME is more advantageous than RIME and other peers in terms of segmentation effect and adaptability to different threshold levels. In conclusion, the proposed CDRIME significantly enhances the global optimization performance and image segmentation of RIME and has great potential to improve COVID-19 diagnosis.

Feature Selection Problem and Metaheuristics: A Systematic Literature Review about Its Formulation, Evaluation and Applications

Feature selection is becoming a relevant problem within the field of machine learning. The feature selection problem focuses on the selection of the small, necessary, and sufficient subset of features that represent the general set of features, eliminating redundant and irrelevant information. Given the importance of the topic, in recent years there has been a boom in the study of the problem, generating a large number of related investigations. Given this, this work analyzes 161 articles published between 2019 and 2023 (20 April 2023), emphasizing the formulation of the problem and performance measures, and proposing classifications for the objective functions and evaluation metrics. Furthermore, an in-depth description and analysis of metaheuristics, benchmark datasets, and practical real-world applications are presented. Finally, in light of recent advances, this review paper provides future research opportunities.

A hematological parameter-based model for distinguishing non-puerperal mastitis from invasive ductal carcinoma

Purpose

Non-puerperal mastitis (NPM) accounts for approximately 4-5% of all benign breast lesions. Ultrasound is the preferred method for screening breast diseases; however, similarities in imaging results can make it challenging to distinguish NPM from invasive ductal carcinoma (IDC). Our objective was to identify convenient and objective hematological markers to distinguish NPM from IDC.

Methods

We recruited 89 patients with NPM, 88 with IDC, and 86 with fibroadenoma (FA), and compared their laboratory data at the time of admission. LASSO regression, univariate logistic regression, and multivariate logistic regression were used to screen the parameters for construction of diagnostic models. Receiver operating characteristic curves, calibration curves, and decision curves were constructed to evaluate the accuracy of this model.

Results

We found significant differences in routine laboratory data between patients with NPM and IDC, and these indicators were candidate biomarkers for distinguishing between the two diseases. Additionally, we evaluated the ability of some classic hematological markers reported in previous studies to differentiate between NPM and IDC, and the results showed that these indicators are not ideal biomarkers. Furthermore, through rigorous LASSO and logistic regression, we selected age, white blood cell count, and thrombin time to construct a differential diagnostic model that exhibited a high level of discrimination, with an area under the curve of 0.912 in the training set and with 0.851 in the validation set. Furthermore, using the same selection method, we constructed a differential diagnostic model for NPM and FA, which also demonstrated good performance with an area under the curve of 0.862 in the training set and with 0.854 in the validation set. Both of these two models achieved AUCs higher than the AUCs of models built using machine learning methods such as random forest, decision tree, and SVM in both the training and validation sets.

Conclusion

Certain laboratory parameters on admission differed significantly between the NPM and IDC groups, and the constructed model was designated as a differential diagnostic marker. Our analysis showed that it has acceptable efficiency in distinguishing NPM from IDC and may be employed as an auxiliary diagnostic tool.

Predicting the therapeutic efficacy of AIT for asthma using clinical characteristics, serum allergen detection metrics, and machine learning techniques

Bronchial asthma is a prevalent non-communicable disease among children. The study collected clinical data from 390 children aged 4-17 years with asthma, with or without rhinitis, who received allergen immunotherapy (AIT). Combining these data, this paper proposed a predictive framework for the efficacy of mite subcutaneous immunotherapy in asthma based on machine learning techniques. Introducing the dispersed foraging strategy into the Salp Swarm Algorithm (SSA), a new improved algorithm named DFSSA is proposed. This algorithm effectively alleviates the imbalance between search speed and traversal caused by the fixed partitioning pattern in traditional SSA. Utilizing the fusion of boosting algorithm and kernel extreme learning machine, an AIT performance prediction model was established. To further investigate the effectiveness of the DFSSA-KELM model, this study conducted an auxiliary diagnostic experiment using the immunotherapy predictive medical data collected by the hospital. The findings indicate that selected indicators, such as blood basophil count, sIgE/tIgE (Der p) and sIgE/tIgE (Der f), play a crucial role in predicting treatment outcome. The classification results showed an accuracy of 87.18% and a sensitivity of 93.55%, indicating that the prediction model is an effective and accurate intelligent tool for evaluating the efficacy of AIT.

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.

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.

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.

An Enhanced Hunger Games Search Optimization with Application to Constrained Engineering Optimization Problems

The Hunger Games Search (HGS) is an innovative optimizer that operates without relying on gradients and utilizes a population-based approach. It draws inspiration from the collaborative foraging activities observed in social animals in their natural habitats. However, despite its notable strengths, HGS is subject to limitations, including inadequate diversity, premature convergence, and susceptibility to local optima. To overcome these challenges, this study introduces two adjusted strategies to enhance the original HGS algorithm. The first adaptive strategy combines the Logarithmic Spiral (LS) technique with Opposition-based Learning (OBL), resulting in the LS-OBL approach. This strategy plays a pivotal role in reducing the search space and maintaining population diversity within HGS, effectively augmenting the algorithm's exploration capabilities. The second adaptive strategy, the dynamic Rosenbrock Method (RM), contributes to HGS by adjusting the search direction and step size. This adjustment enables HGS to escape from suboptimal solutions and enhances its convergence accuracy. Combined, these two strategies form the improved algorithm proposed in this study, referred to as RLHGS. To assess the efficacy of the introduced strategies, specific experiments are designed to evaluate the impact of LS-OBL and RM on enhancing HGS performance. The experimental results unequivocally demonstrate that integrating these two strategies significantly enhances the capabilities of HGS. Furthermore, RLHGS is compared against eight state-of-the-art algorithms using 23 well-established benchmark functions and the CEC2020 test suite. The experimental results consistently indicate that RLHGS outperforms the other algorithms, securing the top rank in both test suites. This compelling evidence substantiates the superior functionality and performance of RLHGS compared to its counterparts. Moreover, RLHGS is applied to address four constrained real-world engineering optimization problems. The final results underscore the effectiveness of RLHGS in tackling such problems, further supporting its value as an efficient optimization method.

Binary arithmetic optimization algorithm for feature selection

Feature selection, widely used in data preprocessing, is a challenging problem as it involves hard combinatorial optimization. So far some meta-heuristic algorithms have shown effectiveness in solving hard combinatorial optimization problems. As the arithmetic optimization algorithm only performs well in dealing with continuous optimization problems, multiple binary arithmetic optimization algorithms (BAOAs) utilizing different strategies are proposed to perform feature selection. First, six algorithms are formed based on six different transfer functions by converting the continuous search space to the discrete search space. Second, in order to enhance the speed of searching and the ability of escaping from the local optima, six other algorithms are further developed by integrating the transfer functions and Lévy flight. Based on 20 common University of California Irvine (UCI) datasets, the performance of our proposed algorithms in feature selection is evaluated, and the results demonstrate that BAOA_S1LF is the most superior among all the proposed algorithms. Moreover, the performance of BAOA_S1LF is compared with other meta-heuristic algorithms on 26 UCI datasets, and the corresponding results show the superiority of BAOA_S1LF in feature selection. Source codes of BAOA_S1LF are publicly available at: https://www.mathworks.com/matlabcentral/fileexchange/124545-binary-arithmetic-optimization-algorithm.

Effective detection of Alzheimer's disease by optimizing fuzzy K-nearest neighbors based on salp swarm algorithm

Alzheimer's disease (AD) is a typical senile degenerative disease that has received increasing attention worldwide. Many artificial intelligence methods have been used in the diagnosis of AD. In this paper, a fuzzy k-nearest neighbor method based on the improved binary salp swarm algorithm (IBSSA-FKNN) is proposed for the early diagnosis of AD, so as to distinguish between patients with mild cognitive impairment (MCI), Alzheimer's disease (AD) and normal controls (NC). First, the performance and feature selection accuracy of the method are validated on 5 different benchmark datasets. Secondly, the paper uses the Structural Magnetic Resolution Imaging (sMRI) dataset, in terms of classification accuracy, sensitivity, specificity, etc., the effectiveness of the method on the AD dataset is verified. The simulation results show that the classification accuracy of this method for AD and MCI, AD and NC, MCI and NC are 95.37%, 100%, and 93.95%, respectively. These accuracies are better than the other five comparison methods. The method proposed in this paper can learn better feature subsets from serial multimodal features, so as to improve the performance of early AD diagnosis. It has a good application prospect and will bring great convenience for clinicians to make better decisions in clinical diagnosis.

Scalable feature subset selection for big data using parallel hybrid evolutionary algorithm based wrapper under apache spark environment

Extant sequential wrapper-based feature subset selection (FSS) algorithms are not scalable and yield poor performance when applied to big datasets. Hence, to circumvent these challenges, we propose parallel and distributed hybrid evolutionary algorithms (EAs) based wrappers under Apache Spark. We propose two hybrid EAs based on the Binary Differential Evolution (BDE), and Binary Threshold Accepting (BTA), namely, (i) Parallel Binary Differential Evolution and Threshold Accepting (PB-DETA), where BDE and BTA work in tandem in every iteration, and (ii) its ablation variant, Parallel Binary Threshold Accepting and Differential Evolution (PB-TADE). Here, BTA is invoked to enhance the search capability and avoid premature convergence of BDE. For comparison purposes, we also parallelized two state-of-the-art algorithms: adaptive DE (ADE) and permutation based DE (DE-FSPM), and named them PB-ADE and P-DE-FSPM respectively. Throughout, logistic regression (LR) is employed to compute the fitness function, namely, area under the receiver operator characteristic curve (AUC). The effectiveness of the proposed algorithms is tested over the five big datasets of varying dimensions. It is noteworthy that the PB-TADE turned out to be statistically significant than the rest. All the algorithms have shown the repeatability property. The proposed parallel model attained a speedup of 2.2-2.9. We also reported feature subset with high AUC and least cardinality.

Equalized Grey Wolf Optimizer with Refraction Opposite Learning

Grey wolf optimizer (GWO) is a global search algorithm based on grey wolf hunting activity. However, the traditional GWO is prone to fall into local optimum, affecting the performance of the algorithm. Therefore, to solve this problem, an equalized grey wolf optimizer with refraction opposite learning (REGWO) is proposed in this study. In REGWO, the issue about the low swarm population variety of GWO in the late iteration is well overcome by the opposing learning of refraction. In addition, the equilibrium pool strategy reduces the likelihood of wolves going to the local extremum. To investigate the effectiveness of REGWO, it is evaluated on 21 widely used benchmark functions and IEEE CEC 2019 test functions. Experimental results show/ that REGWO performs better than the other competitors on most benchmarks.

An enhance multimodal multiobjective optimization genetic algorithm with special crowding distance for pulmonary hypertension feature selection

Multiobjective optimization assumes a one-to-one mapping between decisions and objective space, however, this is not always the case. When many variables have the same or equivalent objective value, a multimodal multiobjective issue develops in which more than one Pareto Set (PS) maps to the same Pareto Front (PF). Evolutionary computing research into multimodal multiobjective optimization issues has increased (MMOPs). This paper proposed an enhanced multimodal multiobjective genetic algorithm to crack MMOPs using a special crowding distance calculation (ESNSGA-II). This special crowding distance calculation can consider the diversity of the decision space while paying attention to the diversity of the object space. Then, a unique crossover mechanism is established by combining the simulated binary crossover (SBX) method with the capacity of Pareto solutions to generate offspring solutions. The balance between convergence and diversity in both decision space and object space can be guaranteed synchronously, and PS distribution and PF accuracy may both be enhanced. The proposed ESNSGA-II uses the CEC2020 benchmarks MMF1-MMF8 to assess its properties. Comparing the ESNSGA-II to other recently established multimodal multiobjective evolutionary techniques demonstrates that it is capable of efficiently searching numerous PSs of MMOPs. Finally, the suggested ESNSGA-II is used to address a real MMOP problem of pulmonary hypertension detection via arterial blood gas analysis. The statistical analysis reveals that the suggested ESNSGA-II algorithm outperforms other algorithms on this MMOP, and so may be considered a possible tool for pulmonary hypertension.