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

作者:

Highlights:

摘要

Feature selection (FS), which aims to select informative feature subsets and improve classification performance, is a crucial data-mining technique. Recently, swarm intelligence has attracted considerable attention and has been successfully applied to FS. Ant colony optimization (ACO), a swarm intelligence algorithm, has shown great potential in FS owing to its graphical representation and search ability. However, designing an effective ACO-based approach for FS is challenging because of issues originating from feature interactions and premature convergence problems. In this study, a novel ACO is proposed that incorporates symmetric uncertainty (SU). By constructing a probabilistic sequence-based graphical representation, the proposed algorithm significantly outperformed six other algorithms on 16 problems in terms of the classification error rate. This study also considers an extensive investigation of the contribution of the two components, namely, probabilistic sequence and SU. The experimental results indicated that these components significantly improved the performance of the ACO-based approach.

论文关键词:Ant colony optimization,Binary graph representation,Classification,Feature selection,Symmetric uncertainty

论文评审过程:Received 26 March 2022, Revised 1 September 2022, Accepted 2 September 2022, Available online 7 September 2022, Version of Record 17 September 2022.

论文官网地址:https://doi.org/10.1016/j.knosys.2022.109874