An improved relief feature selection algorithm based on Monte-Carlo tree search
The goal of feature selection methods is to find the optimal feature subset by eliminating irrelevant or redundant information from the original feature space according to some evaluation criteria. In the literature, the Relief algorithm is a typical feature selection method, which is simple and eas...
Main Authors: | Jianyang Zheng, Hexing Zhu, Fangfang Chang, Yunlong Liu |
---|---|
Format: | Article |
Language: | English |
Published: |
Taylor & Francis Group
2019-01-01
|
Series: | Systems Science & Control Engineering |
Subjects: | |
Online Access: | http://dx.doi.org/10.1080/21642583.2019.1661312 |
Similar Items
-
Monte Carlo Tree Search-Based Recursive Algorithm for Feature Selection in High-Dimensional Datasets
by: Muhammad Umar Chaudhry, et al.
Published: (2020-09-01) -
Feature Selection for Regression Based on Gamma Test Nested Monte Carlo Tree Search
by: Ying Li, et al.
Published: (2021-10-01) -
A Path Planning Method Based on Improved Single Player-Monte Carlo Tree Search
by: Yu-Wei Xia, et al.
Published: (2020-01-01) -
An improved Monte Carlo Tree Search approach to workflow scheduling
by: Hok-Leung Kung, et al.
Published: (2022-12-01) -
Decoupled Monte Carlo Tree Search for Cooperative Multi-Agent Planning
by: Okan Asik, et al.
Published: (2023-02-01)