.png){kind=icon}
Return
Optimal local rejection for classifiers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.06.038.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We analyse optimal rejection strategies for classifiers with input space partitioning, e.g. prototype-based classifiers, support vector machines or decision trees using certainty measures such as the distance to the closest decision border. We provide new theoretical results: we link this problem to the multiple choice knapsack problem and devise an exact polynomial-time dynamic programming (DP) scheme to determine optimal local thresholds on given data. Further, we propose a linear time, memory efficient approximation thereof. We show in experiments that the approximation has a competitive performance compared to the full DP. Further, we evaluate the performance of classification with rejection in various benchmarks: we conclude that local rejection is beneficial in particular for simple classifiers, while the improvement is less pronounced for advanced classifiers. An evaluation on speech prosody and biomedical data highlights the benefit of local thresholds. (C) 2016 Elsevier B.V. All rights reserved.
Keywords:
Classification
Prototype-based
Distance-based
Local rejection
Multiple choice knapsack
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
Cited Papers
Insightful stress detection from physiology modalities using Learning Vector Quantization.png)
NEUROCOMPUTING
OAAI
NEUROCOMPUTINGIF6.5
OAAIShareSaveShareSaveShareSaveShareSave
ShareSaveShareSave
View more