.png){kind=icon}
返回
Explicit and size-adaptive PSO-based feature selection for classification
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2023.101249.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Feature selection (FS) aims to remove the irrelevant and redundant features to improve the classification ac-curacy of the algorithm, which is regarded as an NP-hard problem. Recently, particle swarm optimization (PSO) has shown promise in FS problems, but most previous PSO-based FS methods use implicit representation, whose particle size is equal to the number of original features. Such particle representation not only consumes a lot of memory and computational cost but also leads to a large search space when applied to high-dimensional data. In this paper, we propose a novel representation scheme called explicit representation (i.e. particles are directly represented by the corresponding selected feature subset) and redefine the particle update strategy for the new representation. Moreover, we adopt a feature grouping strategy based on feature importance and divide the original feature set into multiple groups. Finally, a size-adaptive expansion strategy is proposed, in which the swarm automatically determines the next feature group to increase the particle size. The proposed algorithm, called ESAPSO, is able to effectively reduce the particle size as well as the computational cost and the memory occupation. We validate the performance of the proposed ESAPSO with several state-of-the-art algorithms on ten benchmark datasets. Experimental results show that the proposed ESAPSO is usually achieved by better classi-fication performance as well as feature subsets with similar or smaller sizes. This study provides valuable and novel insight into the particle representation of the PSO-based feature selection problem.
Keyword:
Feature selection
Particle swarm optimization
Explicit particle representation
Feature grouping
Size-adaptive expansion
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
A survey on swarm intelligence approaches to feature selection in data mining数据挖掘中特征选择的群体智能方法综述
PREAI
分享收藏Variable-Length Particle Swarm Optimization for Feature Selection on High-Dimensional Classification高维分类特征选择的变长粒子群算法
OAAI
OAAI分享收藏A new ensemble feature selection approach based on genetic algorithm一种新的基于遗传算法的集成特征选择方法.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏A Feature Selection Method Based on Hybrid Improved Binary Quantum Particle Swarm Optimization基于混合改进二进制量子粒子群的特征选择方法IEEE ACCESSOAAI
IEEE ACCESSIF3.6
OAAI分享收藏Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
分享收藏A novel binary many-objective feature selection algorithm for multi-label data classification一种新的用于多标签数据分类的二进制多目标特征选择算法
PREAI
分享收藏A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms关于使用非参数统计检验作为比较进化和群体智能算法的方法的实用教程
PREAI
分享收藏
查看更多内容