.png){kind=icon}
.png){kind=icon}
Return
General solution and learning method for binary classification with performance constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2008.02.025.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, the problem of binary classification is studied with one or two performance constraints. When the constraints cannot be satisfied, the initial problem has no solution and an alternative problem is solved by introducing a rejection option. The optimal solution for such problems in the framework of statistical hypothesis testing is shown to be based on likelihood ratio with one or two thresholds depending on whether it is necessary to introduce a rejection option or not. These problems are then addressed when classes are only defined by labelled samples. To illustrate the resolution of cases with and without rejection option, the problem of Neyman-Pearson and the one of minimizing reject probability subject to a constraint on error probability are studied. Solutions based on SVMs and on a kernel based classifier are experimentally compared and discussed. (C) 2008 Elsevier B.V. All rights reserved.
Keywords:
statistical hypothesis testing
performance constraints
Neyman-Pearson criterion
Chow's rule
classification with rejection option
kernel methods
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W