Skip to main content

Evidential Logistic Regression for Binary SVM Classifier Calibration

  • Conference paper
Belief Functions: Theory and Applications (BELIEF 2014)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8764))

Included in the following conference series:

Abstract

The theory of belief functions has been successfully used in many classification tasks. It is especially useful when combining multiple classifiers and when dealing with high uncertainty. Many classification approaches such as k-nearest neighbors, neural network or decision trees have been formulated with belief functions. In this paper, we propose an evidential calibration method that transforms the output of a classifier into a belief function. The calibration, which is based on logistic regression, is computed from a likelihood-based belief function. The uncertainty of the calibration step depends on the number of training samples and is encoded within a belief function. We apply our method to the calibration and combination of several SVM classifiers trained with different amounts of data.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dempster, A.: The Dempster-Shafer calculus for statisticians. International Journal of Approximate Reasoning 48(2), 365–377 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Denœux, T.: A k-nearest neighbor classification rule based on dempster-shafer theory. IEEE Transactions on Systems, Man and Cybernetics 25(5), 804–813 (1995)

    Article  Google Scholar 

  3. Denœux, T.: A neural network classifier based on dempster-shafer theory. IEEE Transactions on Systems, Man and Cybernetics 30(2), 131–150 (2000)

    Article  Google Scholar 

  4. Denœux, T.: Likelihood-based belief function: justification and some extensions to low-quality data. International Journal of Approximate Reasoning (in Press, 2014), http://dx.doi.org/10.1016/j.ijar.2013.06.007 , doi:10.1016/j.ijar.2013.06.007

  5. Dietterich, T.G.: Approximate statistical tests for comparing supervised classification algorithms. Neural Computation 10(7), 1895–1923 (1998)

    Article  Google Scholar 

  6. Kanjanatarakul, O., Sriboonchitta, S., Denœux, T.: Forecasting using belief functions: an application to marketing econometrics. International Journal of Approximate Reasoning 55(5), 1113–1128 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Niculescu-Mizil, A., Caruana, R.: Predicting good probabilities with supervised learning. In: Proceedings of the 22nd International Conference on Machine Learning, Bonn, Germany, pp. 625–632 (2005)

    Google Scholar 

  8. Platt, J.C.: Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. In: Smola, A.J., Bartlett, P., Schölkopf, B., Schuurmans, D. (eds.) Advances in Large-Margin Classifiers, pp. 61–74. MIT Press (1999)

    Google Scholar 

  9. Quost, B., Denœux, T., Masson, M.H.: Pairwise classifier combination using belief functions. Pattern Recognition Letters 28(5), 644–653 (2007)

    Article  Google Scholar 

  10. Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  11. Sutton-Charani, N., Destercke, S., Denœux, T.: Classification trees based on belief functions. In: Denoeux, T., Masson, M.H. (eds.) Belief Functions: Theory and Applications. AISC, vol. 164, pp. 77–84. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Wu, T.F., Lin, C.J., Weng, R.C.: Probability estimates for multi-class classification by pairwise coupling. Journal of Machine Learning Research 5, 975–1005 (2004)

    MathSciNet  MATH  Google Scholar 

  13. Zadrozny, B., Elkan, C.: Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In: Proceedings of the 18th International Conference on Machine Learning, Williamstown, USA, pp. 609–616 (2001)

    Google Scholar 

  14. Zadrozny, B., Elkan, C.: Transforming classifier scores into accurate multiclass probability estimates. In: Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, USA, pp. 694–699 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Xu, P., Davoine, F., Denoeux, T. (2014). Evidential Logistic Regression for Binary SVM Classifier Calibration. In: Cuzzolin, F. (eds) Belief Functions: Theory and Applications. BELIEF 2014. Lecture Notes in Computer Science(), vol 8764. Springer, Cham. https://doi.org/10.1007/978-3-319-11191-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11191-9_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11190-2

  • Online ISBN: 978-3-319-11191-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics