Learning with rigorous support vector machines.

DOI10.1007/B12006MaRDI QIDQ5305855zbMATH OpenOpenAlexFDO

Authors Jin-Bo Bi, Vladimir Vapnik

Publication date 23 March 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b12006

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Robust learning and generalization with support vector machines.
• Adaptive kernels for support vector classification
• Support-vector networks
• Learning Theory
• Statistical performance of support vector machines

Cited in

(11)

• Growing support vector classifiers with controlled complexity.
• Perturbation to enhance support vector machines for classification.
• Support vector machines are universally consistent
• On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming
• The new interpretation of support vector machines on statistical learning theory
• New method for solving Ivanov regularization-based support vector machine learning
• Support Vector Machines with the Ramp Loss and the Hard Margin Loss
• Radius Margin Bounds for Support Vector Machines with the RBF Kernel
• SVM Model Selection with the VC Bound
• Advances in Neural Networks – ISNN 2005
• Relaxing support vectors for classification

This page was built for publication: Learning with rigorous support vector machines.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5305855)