Multi-strategy ensemble binary hunger games search for feature selection

Spatial mapping of land susceptibility to dust emissions using optimization of attentive Interpretable Tabular Learning (TabNet) model

Dust pollution poses significant risks to human health, air quality, and food safety, necessitating the identification of dust occurrence and the development of dust susceptibility maps (DSMs) to mitigate its effects. This research aims to detect dust occurrence using satellite images and prepare a DSM for Bushehr province, Iran, by enhancing the attentive interpretable tabular learning (TabNet) model through three swarm-based metaheuristic algorithms: particle swarm optimization (PSO), grey wolf optimizer (GWO), and hunger games search (HGS). A spatial database incorporating dust occurrence areas was created using Moderate Resolution Imaging Spectroradiometer (MODIS) images from 2002 to 2022, including 15 influential criteria related to climate, soil, topography, and land cover. Four models were employed for modeling and DSM generation: TabNet, TabNet-PSO, TabNet-GWO, and TabNet-HGS. Evaluation of the modeling results using performance metrics indicated that the TabNet-HGS model outperformed the other models in both training (mean absolute error (MAE) = 0.055, root-mean-square error (RMSE) = 0.1, coefficient of determination (R2) = 0.959), and testing (MAE = 0.063, RMSE = 0.114, R2 = 0.947) data. Following TabNet-HGS, the TabNet-PSO, TabNet-GWO, and TabNet models demonstrated progressively lower accuracy. The validation of the DSM was performed by assessing receiver operating characteristic (ROC) curves, revealing that the TabNet-HGS, TabNet-PSO, TabNet-GWO, and TabNet models exhibited the highest modeling accuracy, with corresponding area under the curve (AUC) values of 0.994, 0.986, 0.98, and 0.832, respectively. These results highlight the enhanced accuracy of dust susceptibility modeling achieved by integrating swarm-based metaheuristic algorithms with the TabNet model. The dust susceptibility map provides valuable insights into the sources, pathways, and impacts of dust particles on the environment and human health in the study area.

Enhancing deep vein thrombosis prediction in patients with coronavirus disease 2019 using improved machine learning model

BACKGROUND

Deep vein thrombosis (DVT) is a significant complication in coronavirus disease 2019 patients, arising from coagulation issues in the deep venous system. Among 424 scheduled patients, 202 developed DVT (47.64%). DVT increases hospitalization risk, and complications, and impacts prognosis. Accurate prognostication and timely intervention are crucial to prevent DVT progression and improve patient outcomes.

METHODS

This study introduces an effective DVT prediction model, named bSES-AC-RUN-FKNN, which integrates fuzzy k-nearest neighbor (FKNN) with enhanced Runge-Kutta optimizer (RUN). Recognizing the insufficient effectiveness of RUN in local search capability and its convergence accuracy, spherical evolutionary search (SES) and differential evolution-inspired knowledge adaptive crossover (AC) are incorporated, termed SES-AC-RUN, to enhance its optimization capability.

RESULTS

Based on the benchmark set by CEC 2017 and comparative analyses with several peers, it is evident that SES-AC-RUN significantly enhances search performance compared to traditional RUN, even standing comparably against leading championship algorithms. The proposed bSES-AC-RUN-FKNN model was applied to predict a dataset comprising 424 cases of DVT patients, totaling 7208 records. Remarkably, the model demonstrates outstanding accuracy, reaching 91.02%, alongside commendable sensitivity at 91.07%.

CONCLUSIONS

The bSES-AC-RUN-FKNN emerges as a robust and efficient predictive tool, significantly enhancing the accuracy of DVT prediction. This model can be used to manage the risk of thrombosis in the care of COVID-19 patients. Nursing staff can combine the model's predictions with clinical judgment to formulate comprehensive treatment approaches.

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.

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.

A feature selection framework for anxiety disorder analysis using a novel multiview harris hawk optimization algorithm

Machine learning (ML) has demonstrated its ability to exploit important relationships within data collection, which can be used in the diagnosis, treatment, and prediction of outcomes in a variety of clinical contexts. Anxiety mental disorder analysis is one of the pending difficulties that ML can help with. A thorough study is demanded to gain a better understanding of this illness. Since the anxiety data is generally multidimensional, which complicates processing and as a result of technology improvements, medical data from several perspectives, known as multiview data (MVD), is being collected. Each view has its own data type and feature values, so there is a lot of diversity. This work introduces a novel preprocessing feature selection (FS) approach, multiview harris hawk optimization (MHHO), which has the potential to reduce the dimensionality of anxiety data, hence reducing analytical effort. The uniqueness of MHHO originates from combining a multiview linking methodology with the power of the harris hawk optimization (HHO) method. The HHO is used to identify the lowest optimal MVD feature subset, while multiview linking is utilized to find a promising fitness function to direct the HHO FS while accounting for all data views' heterogeneity. The complexity of MHHO is O(THL2), where T is the number of iterations, H is the number of involved harris hawks, and L is the number of objects. Using two publicly available anxiety MVDs, MHHO is validated against ten recent rivals in its category. The experimental findings show that MHHO has a considerable advantage in terms of convergence speed (converging in less than ten iterations), subset size (removing 75% of the views; reducing feature size by 66%), and classification accuracy (approaching 100%). Furthermore, statistical analyses reveal that MHHO is statistically different from its competitors, bolstering its applicability. Finally, feature importance is evaluated, shedding light on the most anxiety-inducing characteristics. The likelihood of developing additional disorders (such as depression or stress) is also investigated.

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.

Binary Restructuring Particle Swarm Optimization and Its Application

Restructuring Particle Swarm Optimization (RPSO) algorithm has been developed as an intelligent approach based on the linear system theory of particle swarm optimization (PSO). It streamlines the flow of the PSO algorithm, specifically targeting continuous optimization problems. In order to adapt RPSO for solving discrete optimization problems, this paper proposes the binary Restructuring Particle Swarm Optimization (BRPSO) algorithm. Unlike other binary metaheuristic algorithms, BRPSO does not utilize the transfer function. The particle updating process in BRPSO relies solely on comparison results between values derived from the position updating formula and a random number. Additionally, a novel perturbation term is incorporated into the position updating formula of BRPSO. Notably, BRPSO requires fewer parameters and exhibits high exploration capability during the early stages. To evaluate the efficacy of BRPSO, comprehensive experiments are conducted by comparing it against four peer algorithms in the context of feature selection problems. The experimental results highlight the competitive nature of BRPSO in terms of both classification accuracy and the number of selected features.

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.

Fuzzy-based hunger games search algorithm for global optimization and feature selection using medical data

Feature selection (FS) is one of the basic data preprocessing steps in data mining and machine learning. It is used to reduce feature size and increase model generalization. In addition to minimizing feature dimensionality, it also enhances classification accuracy and reduces model complexity, which are essential in several applications. Traditional methods for feature selection often fail in the optimal global solution due to the large search space. Many hybrid techniques have been proposed depending on merging several search strategies which have been used individually as a solution to the FS problem. This study proposes a modified hunger games search algorithm (mHGS), for solving optimization and FS problems. The main advantages of the proposed mHGS are to resolve the following drawbacks that have been raised in the original HGS; (1) avoiding the local search, (2) solving the problem of premature convergence, and (3) balancing between the exploitation and exploration phases. The mHGS has been evaluated by using the IEEE Congress on Evolutionary Computation 2020 (CEC'20) for optimization test and ten medical and chemical datasets. The data have dimensions up to 20000 features or more. The results of the proposed algorithm have been compared to a variety of well-known optimization methods, including improved multi-operator differential evolution algorithm (IMODE), gravitational search algorithm, grey wolf optimization, Harris Hawks optimization, whale optimization algorithm, slime mould algorithm and hunger search games search. The experimental results suggest that the proposed mHGS can generate effective search results without increasing the computational cost and improving the convergence speed. It has also improved the SVM classification performance.

Binary dwarf mongoose optimizer for solving high-dimensional feature selection problems

Selecting appropriate feature subsets is a vital task in machine learning. Its main goal is to remove noisy, irrelevant, and redundant feature subsets that could negatively impact the learning model's accuracy and improve classification performance without information loss. Therefore, more advanced optimization methods have been employed to locate the optimal subset of features. This paper presents a binary version of the dwarf mongoose optimization called the BDMO algorithm to solve the high-dimensional feature selection problem. The effectiveness of this approach was validated using 18 high-dimensional datasets from the Arizona State University feature selection repository and compared the efficacy of the BDMO with other well-known feature selection techniques in the literature. The results show that the BDMO outperforms other methods producing the least average fitness value in 14 out of 18 datasets which means that it achieved 77.77% on the overall best fitness values. The result also shows BDMO demonstrating stability by returning the least standard deviation (SD) value in 13 of 18 datasets (72.22%). Furthermore, the study achieved higher validation accuracy in 15 of the 18 datasets (83.33%) over other methods. The proposed approach also yielded the highest validation accuracy attainable in the COIL20 and Leukemia datasets which vividly portray the superiority of the BDMO.

Feature Selection Based on Adaptive Particle Swarm Optimization with Leadership Learning

With the rapid development of the Internet of Things (IoT), the curse of dimensionality becomes increasingly common. Feature selection (FS) is to eliminate irrelevant and redundant features in the datasets. Particle swarm optimization (PSO) is an efficient metaheuristic algorithm that has been successfully applied to obtain the optimal feature subset with essential information in an acceptable time. However, it is easy to fall into the local optima when dealing with high-dimensional datasets due to constant parameter values and insufficient population diversity. In the paper, an FS method is proposed by utilizing adaptive PSO with leadership learning (APSOLL). An adaptive updating strategy for parameters is used to replace the constant parameters, and the leadership learning strategy is utilized to provide valid population diversity. Experimental results on 10 UCI datasets show that APSOLL has better exploration and exploitation capabilities through comparison with PSO, grey wolf optimizer (GWO), Harris hawks optimization (HHO), flower pollination algorithm (FPA), salp swarm algorithm (SSA), linear PSO (LPSO), and hybrid PSO and differential evolution (HPSO-DE). Moreover, less than 8% of features in the original datasets are selected on average, and the feature subsets are more effective in most cases compared to those generated by 6 traditional FS methods (analysis of variance (ANOVA), Chi-Squared (CHI2), Pearson, Spearman, Kendall, and Mutual Information (MI)).

Loss Aversion Order Strategy in Emergency Procurement during the COVID-19 Pandemic

The COVID-19 pandemic has had a serious impact on firms’ sourcing strategies. Since COVID-19 disrupted the supply chain, firms have had to make emergency purchases from other suppliers. In addition, emergency ordering is one of the most effective strategies to achieve sustainable operations because such a strategy can save inventory costs. We aim to address a retailer’s emergency procurement strategies during the COVID-19 pandemic. We use prospect theory and the newsvendor model to uncover the retailer’s inventory decisions. In our study, we find that retailers have the choice to order items before the selling period at the normal purchase price, and, if available, they can order them before the end of the selling period at the urgent purchase price. We perform a comparison of the optimal ordering policy and margins in this case with the conventional and loss aversion models. The influence of emergency procurement on the optimal order policy and margins is investigated as well. This paper contributes in theory that we innovatively capture the uncertainty of emergency sourcing, which is a feature that has never been considered in current research.