.png){kind=icon}
返回
A maximum-margin genetic algorithm for misclassification cost minimizing feature selection problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2012.12.086.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a feature selection problem where the decision-making objective is to minimize overall misclassification cost by selecting relevant features from a training dataset We propose a two-stage solution approach for solving misclassification cost minimizing feature selection (MCMFS) problem. Additionally, we propose a maximum-margin genetic algorithm (MMGA) that maximizes margin of separation between classes by taking into account all examples as opposed to maximizing margin of separation using a few support vectors. Feature selection is carried out by either an exhaustive or a heuristic simulated annealing approach in the first stage and a cost sensitive classification using either MMGA or cost sensitive support vector machines (SVM) in the second stage. Using simulated and real-world data sets and different misclassification cost matrices, we test our two-stage approach for solving the MCMFS problem. Our results indicate that feature selection plays an important role when misclassification cost asymmetries increase and the MMGA shows equal or better performance than the SVM. (C) 2012 Elsevier Ltd. All rights reserved.
Keyword:
Feature selection
Cost sensitive classification
Support vector machines
Classification
Data mining
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
暂无机构信息
引用论文
Disentangling in vivo the effects of iron content and atrophy on the ageing human brain.png)
NeuroImage
OAAI
NeuroImageIF0
OAAI分享收藏分享收藏
查看更多内容