Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/22569
Authors: 
Rüping, Stefan
Year of Publication: 
2004
Series/Report no.: 
Technical Report / Universität Dortmund, SFB 475 Komplexitätsreduktion in Multivariaten Datenstrukturen 2004,56
Abstract: 
Support Vector Machines (SVMs) have become a popular learning algorithm, in particular for large, high-dimensional classification problems. SVMs have been shown to give most accurate classification results in a variety of applications. Several methods have been proposed to obtain not only a classification, but also an estimate of the SVMs confidence in the correctness of the predicted label. In this paper, several algorithms are compared which scale the SVM decision function to obtain an estimate of the conditional class probability. A new simple and fast method is derived from theoretical arguments and empirically compared to the existing approaches.
Document Type: 
Working Paper

Files in This Item:
File
Size
99.46 kB
108.35 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.