Error bounds for support vector machines with application to the identification of active constraints
From MaRDI portal
(Redirected from Publication:3562393)
Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Optimality conditions and duality in mathematical programming (90C46)
Recommendations
- Active Set Iteration Method for New L2 Soft Margin Support Vector Machine
- An efficient implementation of an active set method for SVMs
- Adaptive constraint reduction for training support vector machines
- Semismooth support vector machines.
- Two new decomposition algorithms for training bound-constrained support vector machines
Cited in
(4)- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it
- Data preprocessing in semi-supervised SVM classification
- From the support vector machine to the bounded constraint machine
- A global dual error bound and its application to the analysis of linearly constrained nonconvex optimization
This page was built for publication: Error bounds for support vector machines with application to the identification of active constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562393)