Optimal threshold estimation for binary classifiers using game theory

doi:10.12688/f1000research.10114.2

Optimal threshold estimation for binary classifiers using game theory

2016-12-15

0

OA

AI

DOI：10.12688/f1000research.10114.2

原文链接

原文求助

摘要

En 中文

Many bioinformatics algorithms can be understood as binary classifiers. They are usually trained by maximizing the area under the receiver operating characteristic (ROC) curve. On the other hand, choosing the best threshold for practical use is a complex task, due to uncertain and context-dependent skews in the abundance of positives in nature and in the yields/costs for correct/incorrect classification. We argue that considering a classifier as a player in a zero-sum game allows us to use the minimax principle from game theory to determine the optimal operating point. The proposed classifier threshold corresponds to the intersection between the ROC curve and the descending diagonal in ROC space and yields a minimax accuracy of 1-FPR. Our proposal can be readily implemented in practice, and reveals that the empirical condition for threshold estimation of “specificity equals sensitivity” maximizes robustness against uncertainties in the abundance of positives in nature and classification costs.

Optimal threshold estimation for binary classifiers using game theory

摘要

期刊

机构

引用论文