Author： Decoste D.
Publisher： Springer Publishing Company
ISSN： 0885-6125
Source： Machine Learning, Vol.46, Iss.1-3, 2002-01, pp. : 161-190
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Practical experience has shown that in order to obtain the best possible performance, prior knowledge about invariances of a classification problem at hand ought to be incorporated into the training procedure. We describe and review all known methods for doing so in support vector machines, provide experimental results, and discuss their respective merits. One of the significant new results reported in this work is our recent achievement of the lowest reported test error on the well-known MNIST digit recognition benchmark task, with SVM training times that are also significantly faster than previous SVM methods.
Related content
Feasible Direction Decomposition Algorithms for Training Support Vector Machines
By Laskov P.
Machine Learning, Vol. 46, Iss. 1-3, 2002-01 ,pp. :
Access to resources
Recommend
