Handling binary classification problems with a priority class by using Support Vector Machines
Visualitza/Obre
Cita com:
hdl:2117/111896
Tipus de documentArticle
Data publicació2017-12-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
© 2017 Elsevier B.V. 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.
CitacióGonzalez-Abril, L., Angulo, C., Núñez, H., Leal, Y. Handling binary classification problems with a priority class by using Support Vector Machines. "Applied soft computing", 1 Desembre 2017, vol. 61, p. 661-669.
ISSN1568-4946
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
ASOC-D-16-02638R2.pdf | 892,6Kb | Visualitza/Obre |