返回
Evolution of the random subset feature selection algorithm for classification problem
DOI:10.1016/j.knosys.2023.111352.png)
摘要
En 中文
Datasets often include excessive or irrelevant data that affect the performance and complexity of the machine learning model. Feature selection is one of the most effective dimension-reduction technics in datasets to solve the problem. Feature reduction can lead to increased classification accuracy and decreased computational costs. Wrapper feature selection algorithms are a popular and effective category of these methods which considering the learning method's feedback. One of the well-known algorithms in this area is the random subset feature selection algorithm (RSFS). This study proposes an improved version that has higher convergence speed, lower feature selection rate, and higher classification accuracy. Improvements include considering the features' interaction in the selective subsets, continuous evaluation of the selected features to avoid being stuck in the local optima and enhancing the method's evolution phase. To comprehensively evaluate the proposed algorithm, its performance was applied to 20 standard and well-known datasets from public resources and compared with various recent related methods. Experimental results demonstrate that the proposed method reduced classification errors using fewer features compared to other methods, achieving the highest ranking in the Friedman and Wilcoxon rank-sum tests.
Keyword:
Feature selection
Dimension reduction
RSFS algorithm
KNN classifier
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
Gene Expression Omnibus: NCBI gene expression and hybridization array data repository基因表达综合: NCBI基因表达和杂交阵列数据库
NUCLEIC ACIDS RESEARCH
IF13.1
Diagnosing Coronavirus Disease 2019 (COVID-19): Efficient Harris Hawks-Inspired Fuzzy K-Nearest Neighbor Prediction Methods
IEEE ACCESS
IF3.6
BEPO: A novel binary emperor penguin optimizer for automatic feature selectionBEPO: 一种用于自动特征选择的新型二进制帝企鹅优化器

