.png){kind=icon}
返回
Handling binary classification problems with a priority class by using Support Vector Machines
.png){kind=icon}
OA
AI
DOI：10.1016/j.asoc.2017.08.023.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A post-processing technique for Support Vector Machine (SVM) algorithms for binary classification problems is introduced in order to obtain adequate accuracy on a priority class (labelled as a positive class). That is, the true positive rate (or recall or sensitivity) is prioritized over the accuracy of the overall classifier. Hence, false negative (or Type I) errors receive greater consideration than false positive (Type II) errors during the construction of the model. This post-processing technique tunes the initial bias term once a solution vector is learned by using standard SVM algorithms in two steps: First, a fixed threshold is given as a lower bound for the recall measure; second, the true negative rate (or specificity) is maximized. Experiments, carried out on eleven standard UCI datasets, show that the modified SVM satisfies the aims for which it has been designed. Furthermore, results are comparable or better than those obtained when other state-of-the-art SVM algorithms and other usual metrics are considered. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Support Vector Machines
Post-processing strategies
Pattern recognition
Cost-sensitive SVM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
分享收藏Parametric bootstrap methods for testing multiplicative terms in GGE and AMMI models.png)
BiometricsOAAI
BiometricsIF0
OAAI分享收藏
查看更多内容