SDP relaxation for semi-supervised support vector machine
From MaRDI portal
Recommendations
- Conic relaxations for semi-supervised support vector machines
- On convergence rate of a convex relaxation of semisupervised support vector machines
- A new conic approach to semisupervised support vector machines
- A class of semi-supervised support vector machines by DC programming
- Optimization techniques for semi-supervised support vector machines
Cited in
(13)- A proximal quadratic surface support vector machine for semi-supervised binary classification
- A new branch-and-bound approach to semi-supervised support vector machine
- A new conic approach to semisupervised support vector machines
- A class of semi-supervised support vector machines by DC programming
- Sparse proximal support vector machine with a specialized interior-point method
- Optimization approaches to semi-supervised learning
- New SDP models for protein homology detection with semi-supervised SVM
- Conic relaxations for semi-supervised support vector machines
- Optimization techniques for semi-supervised support vector machines
- On convergence rate of a convex relaxation of semisupervised support vector machines
- Mixed-integer quadratic optimization and iterative clustering techniques for semi-supervised support vector machines
- Optimization meets machine learning: an exact algorithm for semi-supervised support vector machines
- Quadratic kernel-free least squares support vector machine for target diseases classification
This page was built for publication: SDP relaxation for semi-supervised support vector machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4906116)
