.png){kind=icon}
返回
An Exponential Monte-Carlo algorithm for feature selection problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2013.10.009.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Feature selection problems (FS) can be defined as the process of eliminating redundant features while avoiding information loss. Due to that fact that FS is an NP-hard problem, heuristic and meta-heuristic approaches have been widely used by researchers. In this work, we proposed an Exponential Monte-Carlo algorithm (EMC-FS) for the feature selection problem. EMC-FS is a meta-heuristic approach which is quite similar to a simulated annealing algorithm. The difference is that no cooling schedule is required. Improved solutions are accepted and worse solutions are adaptively accepted based on the quality of the trial solution, the search time and the number of consecutive non-improving iterations. We have evaluated our approach against the latest methodologies in the literature on standard benchmark problems. The quality of the obtained subset of features has also been evaluated in terms of the number of generated rules (descriptive patterns) and classification accuracy. Our research demonstrates that our approach produces some of the best known results. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Feature selection
Exponential Monte-Carlo
Local search
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
An efficient ant colony optimization approach to attribute reduction in rough set theory粗糙集理论中属性约简的高效蚁群优化方法
PREAI
分享收藏
查看更多内容