Wrapper Feature Selection Research Articles

LLpowershap: logistic loss-based automated Shapley values feature selection method

BackgroundShapley values have been used extensively in machine learning, not only to explain black box machine learning models, but among other tasks, also to conduct model debugging, sensitivity and fairness analyses and to select important features for robust modelling and for further follow-up analyses. Shapley values satisfy certain axioms that promote fairness in distributing contributions of features toward prediction or reducing error, after accounting for non-linear relationships and interactions when complex machine learning models are employed. Recently, feature selection methods using predictive Shapley values and p-values have been introduced, including powershap.MethodsWe present a novel feature selection method, LLpowershap, that takes forward these recent advances by employing loss-based Shapley values to identify informative features with minimal noise among the selected sets of features. We also enhance the calculation of p-values and power to identify informative features and to estimate number of iterations of model development and testing.ResultsOur simulation results show that LLpowershap not only identifies higher number of informative features but outputs fewer noise features compared to other state-of-the-art feature selection methods. Benchmarking results on four real-world datasets demonstrate higher or comparable predictive performance of LLpowershap compared to other Shapley based wrapper methods, or filter methods. LLpowershap is also ranked the best in mean ranking among the seven feature selection methods tested on the benchmark datasets.ConclusionOur results demonstrate that LLpowershap is a viable wrapper feature selection method that can be used for feature selection in large biomedical datasets and other settings.

IMOABC: An efficient multi-objective filter–wrapper hybrid approach for high-dimensional feature selection

With the development of data science, the challenge of high-dimensional data has become increasingly prevalent. High-dimensional data contains a significant amount of redundant information, which can adversely affect the performance and effectiveness of machine learning algorithms. Therefore, it is necessary to select the most relevant features from the raw data and perform feature selection on high-dimensional data. In this paper, a novel filter–wrapper feature selection method based on an improved multi-objective artificial bee colony algorithm (IMOABC) is proposed to address the feature selection problem in high-dimensional data. This method simultaneously considers three objectives: feature error rate, feature subset ratio, and distance, effectively improving the efficiency of obtaining the optimal feature subset on high-dimensional data. Additionally, a novel Fisher Score-based initialization strategy is introduced, significantly enhancing the quality of solutions. Furthermore, a new dynamic adaptive strategy is designed, effectively improving the algorithm’s convergence speed and enhancing its global search capability. Comparative experimental results on microarray cancer datasets demonstrate that the proposed method significantly improves classification accuracy and effectively reduces the size of the feature subset when compared to various traditional and state-of-the-art multi-objective feature selection algorithms. IMOABC improves the classification accuracy by 2.27% on average compared to various multi-objective feature selection methods, while reducing the number of selected features by 88.76% on average. Meanwhile, IMOABC shows an average improvement of 4.24% in classification accuracy across all datasets, with an average reduction of 76.73% in the number of selected features compared to various traditional methods.

A wrapper feature selection approach using Markov blankets

In feature selection, Markov Blanket (MB) based approaches have attracted considerable attention with most MB discovery algorithms being categorized as filter based techniques. Typically, the Conditional Independence (CI) test employed by such methods is different for different data types. In this article, we propose a novel Markov Blanket based wrapper feature selection method. The proposed approach employs Predictive Permutation Independence (PPI), a novel Conditional Independence (CI) test that allows it to work out-of-the-box for both classification and regression tasks on mixed data. PPI can work with any supervised algorithm to estimate the association of a feature with the target variable while also providing a measure of feature importance. The proposed approach also includes an optional MB aggregation step that can be used to find the optimal MB under non-faithful conditions. Our method11Implementation and experimental results are available at https://github.com/AnonymousMLSubmissions/PatternRecognitionSubmission. outperforms other MB discovery methods, in terms of F1-score, by 7% on average, over 3 large-scale BN datasets. It also outperforms state-of-the-art feature selection techniques on 13 real-world datasets.

Turkish Text Classification Based On Wrapper Feature Selection Using Particle Swarm Optimization

The vast majority of the digital era data is stored as text. Text mining is an integral part of data mining. Text classification (TC) is a natural language processing (NLP) operation often needed in text mining. This operation is needed in numerous kinds of research such as information retrieval, document classification, language detection, sentiment analysis, etc. According to the literature, the filter feature selection methods have often been applied to reduce the dimensionality of data in Turkish TC. However, the wrapper-based feature selection methods can provide better classification accuracies than the filter methods. Motivated by this idea, a Turkish TC method based on wrapper feature selection using particle swarm optimization algorithm (PSO) and multinomial naive bayes (MNB) classifier is proposed in this study. TTC-3600 Turkish news texts are used for TC in the experiments. The proposed method achieves a classification accuracy of 94.55% on TTC-3600 Turkish news text dataset by using stemming Tf-Idf features. Hence, it produces competitive accuracies to the cutting-edge Turkish TC methods.

Linear Monotonic Inter-electrode Associations as Quantitative EEG for Alcoholism Diagnosis

Alcohol use disorders (AUDs) are associated with alterations in EEG patterns that reflect underlying neural dysfunctions, such as impaired cognitive processing, reduced neural connectivity, and disrupted brain rhythms. These EEG alterations can be indicative of several brain disorders, including cognitive deficits, mood disorders, and neurodegenerative diseases, which are often exacerbated by chronic alcohol abuse. Cognitive impairment in alcoholic subjects is caused due to altered functional connectivity between brain regions that can be quantified using statistical measures such as correlation. This paper proposes novel Quantitative EEG (QEEG) features comprising the band-wise absolute value of inter-electrode correlations as a measure of brain functional connectivity to classify alcoholic and non-alcoholic EEG. The EEG signal is first decomposed into five frequency sub-bands. In each sub-band, the absolute value of the linear Pearson product-moment correlation coefficient is computed between time-series EEG recorded by electrode pairs placed over different brain regions. To reduce the dimensionality of the feature vector, an ensemble feature selection approach is adopted, utilizing ANOVA and Chi-square, in conjunction with greedy forward feature selection wrapper algorithm. Four classifiers, namely SVM, KNN, ANN and RF are utilized for the classification. Among them, the SVM classifier achieves the best classification accuracies of 100% on validation with test data and 99.58% on cross-validation with train data, respectively.

Uncovering waterlogging-responsive genes in cucumber through machine learning and differential gene correlation analysis

As climate change intensifies, the frequency and severity of waterlogging are expected to increase, necessitating a deeper understanding of the cucumber response to this stress. In this study, three public RNA-seq datasets (PRJNA799460, PRJNA844418, and PRJNA678740) comprising 36 samples were analyzed. Various feature selection algorithms including Uncertainty, Relief, SVM (Support Vector Machine), Correlation, and logistic least absolute shrinkage, and selection operator (LASSO) were performed to identify the most significant genes related to the waterlogging stress response. These feature selection techniques, which have different characteristics, were used to reduce the complexity of the data and thereby identify the most significant genes related to the waterlogging stress response. Uncertainty, Relief, SVM, Correlation, and LASSO identified 4, 4, 10, 21, and 13 genes, respectively. Differential gene correlation analysis (DGCA) focusing on the 36 selected genes identified changes in correlation patterns between the selected genes under waterlogged versus control conditions, providing deeper insights into the regulatory networks and interactions among the selected genes. DGCA revealed significant changes in the correlation of 13 genes between control and waterlogging conditions. Finally, we validated 13 genes using the Random Forest (RF) classifier, which achieved 100% accuracy and a 1.0 Area Under the Curve (AUC) score. The SHapley Additive exPlanations (SHAP) values clearly showed the significant impact of LOC101209599, LOC101217277, and LOC101216320 on the model’s predictive power. In addition, we employed the Boruta as a wrapper feature selection method to further validate our gene selection strategy. Eight of the 13 genes were common across the four feature weighting algorithms, LASSO, DGCA, and Boruta, underscoring the robustness and reliability of our gene selection strategy. Notably, the genes LOC101209599, LOC101217277, and LOC101216320 were among genes identified by multiple feature selection methods from different categories (filtering, wrapper, and embedded). Pathways associated with these specific genes play a pivotal role in regulating stress tolerance, root development, nutrient absorption, sugar metabolism, gene expression, protein degradation, and calcium signaling. These intricate regulatory mechanisms are crucial for cucumbers to adapt effectively to waterlogging conditions. These findings provide valuable insights for uncovering targets in breeding new cucumber varieties with enhanced stress tolerance.

Financial distress prediction using an improved particle swarm optimization wrapper feature selection method and tree boosting ensemble

Financial distress prediction (FDP) is a complex task involving both feature selection and model construction. While many studies have addressed these challenges individually, there is a lack of FDP models that integrate feature selection into the overall model building process. To address the issues of fast convergence and local optimization in particle swarm optimization (PSO), this study proposes a modified PSO algorithm with three improvement strategies. This improved PSO, known as IPSO, is embedded within state-of-the-art tree boosting ensemble models for feature selection. IPSO continuously evolves toward the optimal feature subset, preventing premature convergence and avoiding local optima. To construct the FDP model, four state-of-the-art tree boosting models are combined using an improved majority voting ensemble strategy. The integration of IPSO enhances the prediction performance of the model. Comparative experiments are conducted on samples of Chinese listed companies under short-term and long-term prediction scenarios to evaluate the proposed model. The results demonstrate that IPSO significantly improves the prediction performance, and the ensemble strategy enhances the robustness of the predictions.

Exploring Machine Learning Algorithms to Predict Diarrhea Disease and Identify its Determinants among Under-Five Years Children in East Africa

BackgroundThe second most common cause of death for children under five is diarrhea. Early Predicting diarrhea disease and identify its determinants (factors) using an advanced machine learning model is the most effective way to save the lives of children. Hence, this study aimed to predict diarrheal diseases, identify their determinants, and generate some rules using machine learning models.MethodsThe study used secondary data from the 12 east African countries for DHS dataset analysis using Python. Machine learning techniques such as Random Forest, Decision Tree (DT), K-Nearest Neighbor, Logistic Regression (LR), wrapper feature selection and SHAP values are used for identify determinants.ResultThe final experimentation results indicated the random forest model performed the best to predict diarrhea disease with an accuracy of 86.5%, precision of 89%, F-measure of 86%, AUC curve of 92%, and recall of 82%. Important predictors’ identified age, countries, wealth status, mother’s educational status, mother’s age, source of drinking water, number of under-five children immunization status, media exposure, timing of breast feeding, mother’s working status, types of toilet, and twin status were associated with a higher predicted probability of diarrhea disease.ConclusionAccording to this study, child caregivers are fully aware of sanitation and feeding their children, and moms are educated, which can reduce child mortality by diarrhea in children in east Africa. This leads to a recommendation for policy direction to reduce infant mortality in East Africa.

Advancing XSS Detection in IoT over 5G: A Cutting-Edge Artificial Neural Network Approach

The rapid expansion of the Internet of Things (IoT) and the advancement of 5G technology require strong cybersecurity measures within IoT frameworks. Traditional security methods are insufficient due to the wide variety and large number of IoT devices and their limited computational capabilities. With 5G enabling faster data transmission, security risks have increased, making effective protective measures essential. Cross-Site Scripting (XSS) attacks present a significant threat to IoT security. In response, we have developed a new approach using Artificial Neural Networks (ANNs) to identify and prevent XSS breaches in IoT systems over 5G networks. We significantly improved our model’s predictive performance by using filter and wrapper feature selection methods. We validated our approach using two datasets, NF-ToN-IoT-v2 and Edge-IIoTset, ensuring its strength and adaptability across different IoT environments. For the NF-ToN-IoT-v2 dataset with filter feature selection, our Bilayered Neural Network (2 × 10) achieved the highest accuracy of 99.84%. For the Edge-IIoTset dataset with filtered feature selection, the Trilayered Neural Network (3 × 10) achieved the best accuracy of 99.79%. We used ANOVA tests to address the sensitivity of neural network performance to initial conditions, confirming statistically significant improvements in detection accuracy. The ANOVA results validated the enhancements across different feature selection methods, demonstrating the consistency and reliability of our approach. Our method demonstrates outstanding accuracy and robustness, highlighting its potential as a reliable solution for enhancing IoT security in the era of 5G networks.

Predicting pedalling metrics based on lower limb joint kinematics

This study aimed to predict the index of effectiveness (IE) and positive impulse proportion (PIP) to assess the cyclist’s pedalling technique from lower limb kinematic variables. Several wrapped feature selection techniques were applied to select the best predictors. To predict IE and PIP two multiple linear regressions (MLR) composed of 11 predictors (R² = 0.81 ± 0.12, R² = 0.81 ± 0.05) and two artificial neural networks (ANN) composed of 21 and 28 predictors (R² = 0.95 ± 0.01, R² = 0.92 ± 0.02) were developed. The ANN predicts with accuracy, and the MLR shows the influence of each predictor.

Investigating the Performance of a Novel Modified Binary Black Hole Optimization Algorithm for Enhancing Feature Selection

High-dimensional datasets often harbor redundant, irrelevant, and noisy features that detrimentally impact classification algorithm performance. Feature selection (FS) aims to mitigate this issue by identifying and retaining only the most pertinent features, thus reducing dataset dimensions. In this study, we propose an FS approach based on black hole algorithms (BHOs) augmented with a mutation technique termed MBHO. BHO typically comprises two primary phases. During the exploration phase, a set of stars is iteratively modified based on existing solutions, with the best star selected as the “black hole”. In the exploration phase, stars nearing the event horizon are replaced, preventing the algorithm from being trapped in local optima. To address the potential randomness-induced challenges, we introduce inversion mutation. Moreover, we enhance a widely used objective function for wrapper feature selection by integrating two new terms based on the correlation among selected features and between features and classification labels. Additionally, we employ a transfer function, the V2 transfer function, to convert continuous values into discrete ones, thereby enhancing the search process. Our approach undergoes rigorous evaluation experiments using fourteen benchmark datasets, and it is compared favorably against Binary Cuckoo Search (BCS), Mutual Information Maximization (MIM), Joint Mutual Information (JMI), and minimum Redundancy Maximum Eelevance (mRMR), approaches. The results demonstrate the efficacy of our proposed model in selecting superior features that enhance classifier performance metrics. Thus, MBHO is presented as a viable alternative to the existing state-of-the-art approaches. We make our implementation source code available for community use and further development.

Detection of chronic kidney disease using binary whale optimization algorithm

Chronic kidney disease (CKD), a medical illness, is characterized by a steady deterioration in kidney function. A disease's ability to be prevented and effectively significantly treated depends on early diagnosis. The addition of filter feature selection to the machine learning algorithm has been done to detect CKD. However, the quality of its feature subset is not optimal. Wrapper feature selection can improve the quality of these feature subsets. Therefore, we proposed wrapper feature selection and binary whale optimization algorithm (BWOA) to enhance the accuracy of early CKD detection. We also make data improvements to improve accuracy, namely the preprocessing process with the median and modus techniques. We used a public dataset of 250 medical records of kidney sufferers and 150 completely healthy people. There are 24 features in this dataset. The test results showed that adding BWOA feature selection can increase accuracy. The proposed method produced an accuracy of 100%. Further research on these methods can be used to develop expert systems for early detection of CKD.

Potential dual inhibitors of Hexokinases and mitochondrial complex I discovered through machine learning approach

Hexokinases (Hks) and mitochondrial complex I (MCI) are involved in the energy metabolism of cells; glycolysis/fermentation and oxidative phosphorylation. Both Hks and MCI are known to play critical roles in either division of metabolic plasticity which enables tumor progression and proliferation in the presence of chemotherapies. Therefore, targeting these enzymes are important in cancer drug resistance. Here, computational models for the prediction of inhibition of Hks were developed based on experimental data and an optimal feature subset that was selected by the Boruta algorithm (a wrapper feature selection algorithm coupled with random forest). Out of the seven models that were explored, a random forest classifier gave the best prediction (GA = 0.84, FNR = 0.12 and AUC = 0.96 for the external dataset). Fragmentation analysis led to the identification of the unique structural scaffolds that characterize hexokinase inhibitors and non-inhibitors. The best Hks inhibition model predicted that 23 molecules out of the 191 dataset of MCI actives (IC50 ≤ 10 µM) that were screened, have more than 60 % probability of exhibiting Hk inhibitory activity. Hence, they are possible dual inhibitors of both targets. Furthermore, the 23 molecules’ core structures are members of the scaffolds that are unique to Hk inhibitors earlier predicted by fragment analysis. The need for dual targeting agents in cancer therapy, particularly in combating cancer drug resistance, highlights the relevance of these findings.

ONE3A: one-against-all authentication model for smartphone using GAN network and optimization techniques.

This study focuses on addressing computational limits in smartphones by proposing an efficient authentication model that enables implicit authentication without requiring additional hardware and incurring less computational cost. The research explores various wrapper feature selection strategies and classifiers to enhance authentication accuracy while considering smartphone limitations such as hardware constraints, battery life, and memory size. However, the available dataset is small; thus, it cannot support a general conclusion. In this article, a novel implicit authentication model for smartphone users is proposed to address the one-against-all classification problem in smartphone authentication. This model depends on the integration of the conditional tabular generative adversarial network (CTGAN) to generate synthetic data to address the imbalanced dataset and a new proposed feature selection technique based on the Whale Optimization Algorithm (WOA). The model was evaluated using a public dataset (RHU touch mobile keystroke dataset), and the results showed that the WOA with the random forest (RF) classifier achieved the best reduction rate compared to the Harris Hawks Optimization (HHO) algorithm. Additionally, its classification accuracy was found to be the best in mobile user authentication from their touch behavior data. WOA-RF achieved an average accuracy of 99.62±0.40% with a reduction rate averaging 87.85% across ten users, demonstrating its effectiveness in smartphone authentication.

A novel two-stage wrapper feature selection approach based on greedy search for text sentiment classification

Sentiment analysis is a crucial step in obtaining subjective data from online text sources. Nevertheless, the substantial challenge of high dimensionality prevails within text classification. Addressing this, dimension reduction emerges as a valuable approach to enhance the efficacy of classification in the domain of machine learning. The discerning removal of redundant features not only expedites training processes but also bolsters the achievement of accurate classifications. It is worth noting that the effectiveness of distinct feature selection methodologies can be contingent upon the unique attributes inherent in diverse datasets. Within the purview of this investigation, a novel two-stage approach is introduced, characterized by a greedy search-based wrapper feature selection algorithm. The underpinning of this algorithm involves leveraging the outcomes yielded by filter-based feature selection techniques to establish a prioritized sequence for the scrutiny of features within the proposed framework. This strategic sequencing harnesses the cumulative insights from a series of filter-based methodologies, thereby facilitating the curation of feature subsets that underscore pivotal attributes. Nonetheless, it is acknowledged that the greedy selection approach primarily favors features with high-ranking scores, and thus, it may not adequately evaluate the potential of feature combinations that involve low-scoring elements. An extensive experimental inquiry was conducted across widely recognized sentiment analysis datasets to assess the performance of the introduced methodology. The computational findings eloquently demonstrate that the proposed algorithm attains an average accuracy of 96.88% for nine public sentiment datasets and 94.43% for the Humir datasets when coupled with the multinomial Naive Bayes classifier. Furthermore, the experimental outcomes conspicuously establish the superiority of the proposed technique in state-of-the-art studies across the same set of nine sentiment datasets and the Humir datasets.

Machine Learning and Feature Selection for soil spectroscopy. An evaluation of Random Forest wrappers to predict soil organic matter, clay, and carbonates

Soil spectroscopy estimates soil properties using the absorption features in soil spectra. However, modelling soil properties with soil spectroscopy is challenging due to the high dimensionality of spectral data. Feature Selection wrapper methods are promising approaches to reduce the dimensionality but are barely used in soil spectroscopy. The aim of this study is to evaluate the performance of two feature selection wrapper methods, Sequential Forward Selection (SFS) and Sequential Flotant Forward Selection (SFFS) built using the Random Forest (RF) algorithm, for dimensionality reduction of spectral data and predictive modelling of modelling soil organic matter (SOM), clay and carbonates. The reflectance of 100 soil samples, acquired from Sierra de las Nieves (Spain), was measured under laboratory conditions using ASD FieldSpec Pro JR. Four different datasets were obtained after applying two spectral preprocessing methods to raw spectra: raw spectra, Continuum Removal (CR), Multiplicative Scatter Correction (MSC), and a so-called “Global” dataset composed of raw, CR and MSC features. The performance of RF models built with feature selection methods was compared to that of Partial Least Squares Regression (PLSR) and RF (alone).RF models built with SFS and SFFS outperformed PLSR and RF alone models: The best RF models with feature selection had a respective ratio of performance to interquartile distance of 1.93, 0.38 and 2.56. PLSR models had an accuracy of 1.41, 0.29 and 1.81 for SOM, carbonates, and clay, respectively. RF alone had a respective performance of 1.29, 0.29 and 1.81. The application of feature selection wrapper methods reduced the number of features to less than 1 % of the starting features. Features were selected across all spectra for SOM and clay, and around 900 nm, 1900 nm, and 2350 nm for carbonates. However, feature selection highlighted features around 1100 nm in SOM modelling, as well as other features around 2200 nm, which is considered a main absorption feature of clay. The application of feature selection with Random Forest was very important in improving modelling accuracy, reducing the redundant features and avoiding the curse of dimensionality or Hughes effect. Thus, this research showed an alternative to dimensionality reduction approaches that have been applied to date to model soil properties with spectroscopy and paves the way for further scientific investigation based on feature selection methods and machine learning.

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.

Feature selection based on dynamic crow search algorithm for high-dimensional data classification

High-dimensional biomedical data plays an important role in disease diagnosis and classification. To analyze the high-dimensional biomedical data, machine learning algorithms are widely used. However, a great amount of redundant, irrelevant or weak correlation features are prevalent in these datasets, which significantly deteriorate the capability of machine learning techniques. It is necessary to select the most informative features and discard the useless ones for enhancing the classification accuracy and reducing the dimensionality. To address this issue, an improved Crow Search Algorithm (CSA) which is known as the Dynamic CSA (DCSA) is proposed to find the optimal feature subset in high-dimensional classification tasks. In DCSA, three modifications are investigated. Firstly, we propose a dynamic bi-level awareness probability to guide the transition between global search and local search. Consequently, the balance between exploration and exploitation is improved. Secondly, levy flight with a unfixed step length control parameter is employed as the global search and the random search mechanism of the original CSA is abandoned. Thirdly, a dynamic flight length strategy is adopted to enhance the local search and speed up convergence. All in all, DCSA is developed as a wrapper feature selection model, where KNN classifier is applied as the feature subset evaluator. The performance of DCSA is measured on seven high-dimensional biomedical datasets. Experimental results show that DCSA outperforms other state-of-the-art methods. Specifically, DCSA achieved the highest average accuracy in six data. In terms of numbers of selected features, DCSA gained the smallest subset size in a seven data. And for SRBCT data, the prediction accuracy of DCSA is at 100%.

Optimizing prediction accuracy for early recurrent lumbar disc herniation with a directional mutation-guided SVM model

Percutaneous endoscopic lumbar discectomy (PELD) is one of the main means of minimally invasive spinal surgery, and is an effective means of treating lumbar disc herniation, but its early recurrence is still difficult to predict. With the development of machine learning technology, the auxiliary model based on the prediction of early recurrent lumbar disc herniation (rLDH) and the identification of causative risk factors have become urgent problems in current research. However, the screening ability of current models for key factors affecting the prediction of rLDH, as well as their predictive ability, needs to be improved. Therefore, this paper presents a classification model that utilizes wrapper feature selection, developed through the integration of an enhanced bat algorithm (BDGBA) and support vector machine (SVM). Among them, BDGBA increases the population diversity and improves the population quality by introducing directional mutation strategy and guidance-based strategy, which in turn allows the model to secure better subsets of features. Furthermore, SVM serves as the classifier for the wrapper feature selection method, with its classification prediction results acting as a fitness function for the feature subset. In the proposed prediction method, BDGBA is used as an optimizer for feature subset filtering and as an objective function for feature subset evaluation based on the classification results of the support vector machine, which improves the interpretability and prediction accuracy of the model. In order to verify the performance of the proposed method, this paper proves the performance of the model through global optimization experiments and prediction experiments on real data sets. The accuracy of the proposed rLDH prediction model is 93.49% and sensitivity is 88.33%. The experimental results show that Level of herniated disk, Modic change, Disk height, Disk length, and Disk width are the key factors for predicting rLDH, and the proposed method is an effective auxiliary diagnosis method.

Efficient traffic-based IoT device identification using a feature selection approach with Lévy flight-based sine chaotic sub-swarm binary honey badger algorithm

Internet of Things (IoT) refers to the various devices connected to the Internet, enabling them to communicate and transmit data with each other. The rapid development of the IoT also brings security and other problems in cyberspace. In this case, device identification is a crucial tool for IoT security issues, which can detect and prevent cyber-attacks. However, device identification has some challenges on IoT traffic datasets, such as large-scale and high-dimensional sparse datasets, features prone to security vulnerabilities, and identification of IP and non-IP devices, which affects the performance of classifiers. Feature selection can be seen as an effective data preprocessing technique in IoT device identification, which may improve the performance of classification and reduce the computational complexity of IoT device identification. In this paper, we propose a traffic-based IoT device identification model using a novel wrapper feature selection approach based on an improved and efficient method, which we call Lévy flight-based sine chaotic sub-swarm binary honey badger algorithm (LS2-BHBA). Specifically, four improved factors are employed in LS2-BHBA to expand the search scope, balance the exploration and exploitation phases, and enhance the search capability. In addition, a binary mechanism is implemented to enhance the suitability of the proposed LS2-BHBA for feature selection in IoT device identification. The experimental results on several real IoT traffic datasets denote that LS2-BHBA can reduce the number of features to 10%, and the classification accuracy can reach 98%, which outperforms some classical and latest comparison algorithms in the feature selection of IoT device identification.