Wrapper-based feature selection for general data set: the quantum sand cat swarm optimization
The existing wrapper feature selection methods have problems such as the difficulty of balancing a relatively high classification accuracy rate with a low feature selection rate, and there are problems such as long time consumption. In response to these issues, this paper combines quantum computing theory and sand cat swarm optimization to design quantum sand cat swarm optimization and combined with K-nearest neighbor method for feature selection. The optimal solution of quantum sand cat swarm optimization is set as the selected optimal feature subset. Simulation experiments are executed on 6 UCI data sets to compare with 4 classical swarm intelligence algorithms. The simulation outcomes show that the wrapper feature selection on the ground of quantum sand cat swarm optimization achieves lower feature selection rate , faster time and higher classification accuracy than the comparison method. It is a high precision and practical wrapper feature selection method.
Authors
- Hongyuan Gao (ORCID: https://orcid.org/0000-0001-8505-6828)
- Ying Guo (ORCID: https://orcid.org/0009-0004-0774-5416)
- Jin Long Yue
Institutions
- Harbin Engineering University (CN)
- Dalian University of Technology (CN)
Publication Details
- Published
- 2024-11-24
- DOI
- https://doi.org/10.1109/iccvit63928.2024.10872543
- Citations
- 1
- Primary Topic
- Neural Networks and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.35