arrow
返回

An interactive feature selection method based on multi-step state transition algorithm for high-dimensional data

delete2023-12-01
delete3
PRE
AI
Y
Yangyi Du
周晓君 封面图
周晓君 (Xiaojun Zhou) *
C
Chunhua Yang
T
Tingwen Huang
DOI:10.1016/j.knosys.2023.111102delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Feature selection (FS) has been extensively employed in classification tasks to reduce data dimensionality and enhance prediction performance effectively. Recently, hybrid filter-wrapper methods have exhibited promising results in FS problems by leveraging both advantages. However, the inadequate integration of the filter method into the wrapper method leads to the hybrid algorithms exhibiting poor efficiency in classification as datasets grow in complexity. In this paper, an interactive feature selection framework based on state transition algorithm (STA) is proposed to address high-dimensional FS problems. In this framework, prior knowledge of the features is formed via the mutual information-based filter method. The STA is a powerful search engine that traverses the feature space in the wrapper stage. Moreover, an external trainer with prior knowledge will guide the exploration direction of STA in a simple but efficient way to accelerate the search process. And a self-adaptive mechanism is proposed to adjust the prior knowledge during the search process. Specifically, the external trainer establishes the interactive loop, while the self-adaptive mechanism aims to feed feature information back to the loop. In addition, the search process is prevented from being trapped in local optima by employing a multi-step STA, which allows for continuous transformations of the solution in probability. Finally, the proposed FS method is applied to various public classification datasets. The experimental results demonstrate that the proposed method is a highly competitive FS method, outperforming several state-of-the-art algorithms in generating an optimal subset of features.
Keyword:
Feature selection
State transition algorithm
Interactive learning
Mutual information

期刊

K
Knowledge-Based Systems
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

C
Central South University
学者数:
10.0W
论文数: 7.2W
被引数: 10.9W
Q
qatar foundation (qf)
学者数:
6.3K
论文数: 7.0K
被引数: 8
引用论文

引用论文

Data Center Power Oversubscription with a Medium Voltage Power Plane and Priority-Aware Capping
err2020-03-13
err0
errOAAI
errVarun Sakalkar; Vasileios Kontorinis; David Landhuis; Shaohong Li; Darren De Ronde; Thomas Blooming; Anand Ramesh; James Kennedy; Christopher Malone; Jimmy Clidaras; Parthasarathy Ranganathan
err分享
err收藏
err分享
err收藏
学者 查看更多内容