Evidential calibration of binary SVM classifiers

https://doi.org/10.1016/j.ijar.2015.05.002Get rights and content
Under an Elsevier user license
open archive

Abstract

In machine learning problems, the availability of several classifiers trained on different data or features makes the combination of pattern classifiers of great interest. To combine distinct sources of information, it is necessary to represent the outputs of classifiers in a common space via a transformation called calibration. The most classical way is to use class membership probabilities. However, using a single probability measure may be insufficient to model the uncertainty induced by the calibration step, especially in the case of few training data. In this paper, we extend classical probabilistic calibration methods to the evidential framework. Experimental results from the calibration of SVM classifiers show the interest of using belief functions in classification problems.

Keywords

Classifier calibration
Theory of belief functions
Dempster–Shafer theory
Evidence theory
Support vector machine

Cited by (0)

This paper is a revised and extended version of [36].