Information-Theory-based Nondominated Sorting Ant Colony Optimization for Multiobjective Feature Selection in Classification
- 22 August 2022
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 53 (8) , 5276-5289
Abstract
Feature selection (FS) has received significant attention since the use of a well-selected subset of features may achieve better classification performance than that of full features in many real-world applications. It can be considered as a multiobjective optimization consisting of two objectives: 1) minimizing the number of selected features and 2) maximizing classification performance. Ant colony optimization (ACO) has shown its effectiveness in FS due to its problem-guided search operator and flexible graph representation. However, there lacks an effective ACO-based approach for multiobjective FS to handle the problematic characteristics originated from the feature interactions and highly discontinuous Pareto fronts. This article presents an Information-theory-based Nondominated Sorting ACO (called INSA) to solve the aforementioned difficulties. First, the probabilistic function in ACO is modified based on the information theory to identify the importance of features; second, a new ACO strategy is designed to construct solutions; and third, a novel pheromone updating strategy is devised to ensure the high diversity of tradeoff solutions. INSA’s performance is compared with four machine-learning-based methods, four representative single-objective evolutionary algorithms, and six state-of-the-art multiobjective ones on 13 benchmark classification datasets, which consist of both low and high-dimensional samples. The empirical results verify that INSA is able to obtain solutions with better classification performance using features whose count is similar to or less than those obtained by its peers.Keywords
Funding Information
- National Key Research and Development Program of China (2018AAA0101203)
- National Natural Science Foundation of China (62072483, 61872271)
- Japan Society for the Promotion of Science (JSPS) Kakenhi (JP22H03643, JP20K19945)
- Japan Science and Technology Agency (JST) (JPMJFS2115)
- Fundo para o Desenvolvimento das Ciências e da Tecnologia (0047/2021/A1)
This publication has 82 references indexed in Scilit:
- A new wrapper feature selection approach using neural networkNeurocomputing, 2010
- Feature subset selection in large dimensionality domainsPattern Recognition, 2010
- A novel ACO–GA hybrid algorithm for feature selection in protein function predictionExpert Systems with Applications, 2009
- Research of multi-population agent genetic algorithm for feature selectionExpert Systems with Applications, 2009
- Feature selection to diagnose a business crisis by using a real GA-based support vector machine: An empirical studyExpert Systems with Applications, 2007
- A genetic algorithm-based method for feature subset selectionSoft Computing, 2007
- An Ant Colony Optimization Algorithm for the Redundancy Allocation Problem (RAP)IEEE Transactions on Reliability, 2004
- A fast and elitist multiobjective genetic algorithm: NSGA-IIIEEE Transactions on Evolutionary Computation, 2002
- Greedy function approximation: A gradient boosting machine.The Annals of Statistics, 2001
- Using mutual information for selecting features in supervised neural net learningIEEE Transactions on Neural Networks, 1994