IHBOFS: A Biomimetics-Inspired Hybrid Breeding Optimization Algorithm for High-Dimensional Feature Selection

An efficient hybrid sine-cosine Harris hawks optimization for low and high-dimensional feature selection

A velocity-based butterfly optimization algorithm for high-dimensional optimization and feature selection

Modified swarm intelligence algorithms for the pharmacy duty scheduling problem

Chapter 14 - Review on hybrid feature selection and classification of microarray gene expression data

Many evolutionary computation (EC) methods have been used to solve feature selection problems and they perform well on most small-scale feature selection problems. However, as the dimensionality of feature selection problems increases, the solution space increases exponentially. Meanwhile, there are more irrelevant features than relevant features in datasets, which leads to many local optima in the huge solution space. Therefore, the existing EC methods still suffer from the problem of stagnation in local optima on large-scale feature selection problems. Furthermore, large-scale feature selection problems with different datasets may have different properties. Thus, it may be of low performance to solve different large-scale feature selection problems with an existing EC method that has only one candidate solution generation strategy (CSGS). In addition, it is time-consuming to find a suitable EC method and corresponding suitable parameter values for a given large-scale feature selection problem if we want to solve it effectively and efficiently. In this article, we propose a self-adaptive particle swarm optimization (SaPSO) algorithm for feature selection, particularly for large-scale feature selection. First, an encoding scheme for the feature selection problem is employed in the SaPSO. Second, three important issues related to self-adaptive algorithms are investigated. After that, the SaPSO algorithm with a typical self-adaptive mechanism is proposed. The experimental results on 12 datasets show that the solution size obtained by the SaPSO algorithm is smaller than its EC counterparts on all datasets. The SaPSO algorithm performs better than its non-EC and EC counterparts in terms of classification accuracy not only on most training sets but also on most test sets. Furthermore, as the dimensionality of the feature selection problem increases, the advantages of SaPSO become more prominent. This highlights that the SaPSO algorithm is suitable for solving feature selection problems, particularly large-scale feature selection problems.

With the growing complexity of high-dimensional imbalanced datasets in critical fields such as medical diagnosis and bioinformatics, feature selection has become essential to reduce computational costs, alleviate model bias, and improve classification performance. DS-IHBO, a dynamic surrogate-assisted feature selection algorithm integrating relevance-based redundant feature filtering and an improved hybrid breeding algorithm, is presented in this paper. Departing from traditional surrogate-assisted approaches that use static approximations, DS-IHBO employs a dynamic surrogate switching mechanism capable of adapting to diverse data distributions and imbalance ratios through multiple surrogate units built via clustering. It enhances the hybrid breeding algorithm with asymmetric stratified population initialization, adaptive differential operators, and t-distribution mutation strategies to strengthen its global exploration and convergence accuracy. Tests on 12 real-world imbalanced datasets (4–98% imbalance) show that DS-IHBO achieves a 3.48% improvement in accuracy, a 4.80% improvement in F1 score, and an 83.85% reduction in computational time compared with leading methods. These results demonstrate its effectiveness for high-dimensional imbalanced feature selection and strong potential for real-world applications.

With the growth of Internet, there has been a tremendous increases in the number of attacks and therefore Intrusion Detection Systems (IDS’s) has become a main stream of information security. The purpose of IDS is to help the computer systems to deal with attacks. This anomaly detection system creates a database of normal behaviour and deviations from the normal behaviour to trigger during the occurrence of intrusions. Based on the source of data, IDS is classified into Host based IDS and Network based IDS. In network based IDS, the individual packets flowing through the network are analyzed where as in host based IDS the activities on the single computer or host are analyzed. The feature selection used in IDS helps to reduce the classification time. In this paper, the IDS for detecting the attacks effectively has been proposed and implemented. For this purpose, a new feature selection algorithm called Optimal Feature Selection algorithm based on Information Gain Ratio has been proposed and implemented. This feature selection algorithm selects optimal number of features from KDD Cup dataset. In addition, two classification techniques namely Support Vector Machine and Rule Based Classification have been used for effective classification of the data set. This system is very efficient in detecting DoS attacks and effectively reduces the false alarm rate. The proposed feature selection and classification algorithms enhance the performance of the IDS in detecting the attacks.

Feature selection plays an important role in the fields of pattern recognition, data mining and machine learning. Rough set method is one of effective methods for feature selection, which can preserve the meaning of the features. Presently ant colony optimization (ACO) has been successfully applied to rough set-based feature selection, however, it has the limitations of many control parameters, premature convergence and stagnation. In this paper, we propose a novel discrete artificial bee colony algorithm to overcome these drawbacks. In our algorithm, a search mechanism centered with feature core is introduced to avoid blindly searching, in which the values of corresponding bits of these features in feature core are unchanged during the iterative process. Meanwhile, Tabu search is adopted to avoid falling into local optima for every employed bee who can not select the solution of the Tabu list in each generation. In this work, our algorithm is applied to eight datasets from UCI database and the results produced by our algorithm and some rough set-based feature selection algorithms have been compared. The results show that our algorithm outperforms the other algorithms.

In the present state of affairs, the motive behind every educational organization is to uplift the academic achievement of students. Educational data mining (EDM) is an upward field of research, and it is very helpful for academic institutions to predict the academic performance of the students. Educational datasets are the basis of various predictive models. Quality of these models can be improved by using feature selection (FS). To get the required benefits from the available data, there must be some tools for analysis and prediction. In lieu of the above, machine learning/data mining are most suitable. In educational data mining, for better accuracy of prediction models’ and quality of various educational datasets, feature selection (FS) plays a vital role. Feature selection (FS) algorithms abolish inappropriate information from the repositories of educational background so that performance of classifier in terms of accuracy could be increased and the same could be used for better decision. In lieu of the above, a best feature selection algorithm must be selected. In this paper, two filter selection approaches namely correlation feature selection (CFS) and wrapper-based feature selection have been used to demonstrate the importance of selection of a feature subset for a classification problem. The present paper aims to find the detailed investigation of filter feature selection algorithms along with the classification algorithms on a given dataset. We found result with numerous numbers of features from various Feature selection algorithms and classifiers which will help the researcher to discover the most excellent mixture of filter feature selection algorithms and its associated classifiers. The result indicates that SMO and J48 have the highest accuracy measures with the correlation feature selection algorithms, while Naïve Bayes has the highest accuracy measures with the wrapper subset feature selection algorithms for predicting high, medium and low grade for the students.

High-dimensional datasets (HDDs) pose significant challenges in feature selection due to their complex nature. While metaheuristic algorithms like the Whale Optimisation Algorithm (WOA) have shown promise in addressing these challenges, stability issues are least addressed. Through an extensive literature review, it was identified that stability is manifested in the equilibrium of exploration and exploitation. Hence, this study introduced the Hierarchical Whale Optimisation Algorithm (HiWOA), an approach designed to enhance the WOA’s stability and performance in HDD feature selection tasks. The HiWOA incorporates a two-phase strategy comprising a nonlinear control parameter based on the arcsine function and a hierarchical position-update mechanism adapted from the Grey Wolf Optimiser. The proposed HiWOA was evaluated through 23 benchmark optimisation functions and feature selection experiments on 11 medical HDDs. The results indicate that the HiWOA outperformed the WOA and a modified variant (mWOA) in terms of a better fitness value, a more balanced exploration-exploitation ratio, and improved classification accuracy with fewer selected features. These findings demonstrate the HiWOA’s effectiveness in enhancing stability, making it a robust solution for high-dimensional optimisation and feature selection.

Symmetric uncertainty-incorporated probabilistic sequence-based ant colony optimization for feature selection in classification

Feature selection is an important processing step of data mining and aims at selecting a subset with high quality. The feature subset is obtained by reducing the irrelevant and redundant features based on maintaining satisfactory accuracy. Many algorithms might be trapped in local optima on solving high-dimensional feature selection. Hybrid rice optimization (HRO) is a newly presented algorithm, its population is divided into three types such as the maintainer, restorer, and sterile line to simulate the breeding process of Chinese hybrid rice. Three main stages are designed to update the restorer and sterile line. However, the maintainer line is not updated in HRO, which degrades the performance of the algorithm on high-dimensional feature selection. In this paper, a hybrid model named HROAS is proposed for feature selection by combining HRO with ant system (AS). AS is embedded as an operator in HRO to update the maintainer line due to its unique updating mechanism. The performance of HROAS is evaluated on nine standard benchmark datasets and compared with several classic and novel algorithms. The experimental results demonstrate the outperformance of HROAS.

Feature selection is a required preprocess stage in most of the data mining tasks. This paper presents an improved Harris hawks optimization (HHO) to find high-quality solutions for global optimization and feature selection tasks. This method is an efficient optimizer inspired by the behaviors of Harris' hawks, which try to catch the rabbits. In some cases, the original version tends to stagnate to the local optimum solutions. Hence, a novel HHO called IHHO is proposed by embedding the salp swarm algorithm (SSA) into the original HHO to improve the search ability of the optimizer and expand the application fields. The update stage in the HHO optimizer, which is performed to update each hawk, is divided into three phases: adjusting population based on SSA to generate SSA-based population, generating hybrid individuals according to SSA-based individual and HHO-based individual, and updating search agent in the light of greedy selection and HHO’s mechanisms. A large group of experiments on many functions is carried out to investigate the efficacy of the proposed optimizer. Based on the overall results, the proposed IHHO can provide a faster convergence speed and maintain a better balance between exploration and exploitation. Moreover, according to the proposed continuous IHHO, a more stable binary IHHO is also constructed as a wrapper-based feature selection (FS) approach. We compare the resulting binary IHHO with other FS methods using well-known benchmark datasets provided by UCI. The experimental results reveal that the proposed IHHO has better accuracy rates over other compared wrapper FS methods. Overall research and analysis confirm the improvement in IHHO because of the suitable exploration capability of SSA.

Software defect detection is a critical research topic in the field of software engineering, aiming to identify potential defects during the development process to improve software quality and reduce maintenance costs. This study proposes a novel feature selection and defect prediction classification algorithm based on a multi-strategy enhanced Parrot Optimization (PO) algorithm. Firstly, to address the limitations of the original Parrot Optimization algorithm, such as strong dependence on the initial population, premature convergence, and insufficient global search capability, this article develops a multi-strategy enhanced Parrot Optimization algorithm (MEPO). Experiments conducted on eight benchmark test functions validate the superior performance of MEPO in terms of convergence speed and solution accuracy. Secondly, to mitigate the adverse impact of irrelevant features on model performance in traditional software defect prediction methods, this study introduces a binary multi-strategy enhanced Parrot Optimization algorithm (BMEPO) for optimizing feature selection. Comparative experiments demonstrate that BMEPO exhibits stronger competitiveness in feature selection quality and classification performance compared to advanced feature selection algorithms. Finally, to further enhance the classification performance of defect prediction, a heterogeneous data stacking ensemble learning algorithm (HEDSE) based on feature selection is proposed. Experimental evaluations on 16 open-source software defect datasets indicate that the proposed HEDSE outperforms existing methods, providing a novel and effective solution for software defect prediction. The proposed approaches in this study hold significant practical value, particularly in improving software quality, optimizing testing resource allocation, and reducing maintenance costs, offering broad potential for application in real-world software engineering scenarios.

A novel quantum grasshopper optimization algorithm for feature selection