arrow
Return

A meta-heuristic feature selection algorithm combining random sampling accelerator and ensemble using data perturbation

delete2023-11-03
delete5
PRE
AI
S
Shuaishuai Zhang
K
Keyu Liu
T
Taihua Xu *
杨
杨习贝 (Xibei Yang)
A
Ao Zhang
DOI:10.1007/s10489-023-05123-0delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Meta-heuristic algorithms have been extensively utilized in feature selection tasks because they can obtain the global optimal solution. However, the meta-heuristic algorithm will take too much time in the face of a large number of samples. Although most of the studies compromise to approximate optimal solutions for avoiding time-consuming problems, a new problem with reduced classification performance, especially classification stability, is then generated. Aiming to above problems, this paper proposes a new feature selection framework. First, this framework exploits a voting ensemble strategy to improve classification stability by reducing the impact of misclassified labels on the overall classification results. Second, the framework uses a data perturbation strategy to enhance classification accuracy. In particular, the data perturbation strategy is able to generate more neighborhood relationships in the dataset, which could reveal the distribution of various features of the samples. A voting ensemble of different feature distributions is capable of extracting more information from the dataset, then the initially misclassified samples are more likely to be returned to the correct classification. Third, the framework takes a random sampling accelerator into account to solve the problem of excessive time consumption by reducing the size of the search sample space. Finally, for the sake of verifying the effectiveness of the proposed framework, four meta-heuristic feature selection methods based on a neighborhood rough set are compared on 20 datasets. The experimental results indicate that our framework could improve classification performance and accelerate feature selection, particularly in confronting large sample sizes.
Keywords:
Feature selection
Meta-heuristic
Neighborhood rough set
Data perturbation
Random sampling

Journal

Applied Intelligence cover
Applied Intelligence
IF:
3.5
Papers:
7.6K
Citations:
1.7W

Organization

S
Southwest Jiaotong University
Scholars:
2.9W
Papers: 2.1W
Citations: 2.3W
J
jiangsu university of science & technology
Scholars:
9.0K
Papers: 6.9K
Citations: 9
Cited Papers

Cited Papers

Discernibility matrix based incremental attribute reduction for dynamic data
err2018-01-01
err76
PREAI
errWei, Wei; Wu, Xiaoying; Liang, Jiye; Cui, Junbiao; Sun, Yijun
errShare
errSave
Feature Selection Based on Modified Bio-inspired Atomic Orbital Search Using Arithmetic Optimization and Opposite-Based Learning
err2022-06-22
err9
PREAI
errAbd Elaziz, Mohamed; Ouadfel, Salima; Abd El-Latif, Ahmed A.; Ali Ibrahim, Rehab
errShare
errSave
Quickly calculating reduct: An attribute relationship based approach
err2020-07-01
err39
PREAI
errRao, Xiansheng; Yang, Xibei; Yang, Xin; Chen, Xiangjian; Liu, Dun; Qian, Yuhua
errShare
errSave
PL02: Probiotic regimen for outpatient gastroenteritis utility of treatment (PROGUT) study: a multicenter randomized controlled trial
errCJEM
IF0
err2018-05-11
err0
errOAAI
errS. Freedman; S. Williamson-Urquhart; K. Farion; S. Gouin; A. Willan; N. Poonai; K. Hurley; P. Sherman; Y. Finkelstein; B. Lee; X. Pang; L. Chui; D. Schnadower; J. Xie; M. Gorelick; S. Schuh
errShare
errSave
Rough set-based feature selection for weakly labeled data
err2021-09-01
err34
errOAAI
errCampagner, Andrea; Ciucci, Davide; Huellermeier, Eyke
errShare
errSave
researcher View more