Conic relaxations for semi-supervised support vector machines
DOI10.1007/S10957-015-0843-4zbMATH Open1341.62171OpenAlexW2179852860MaRDI QIDQ289094FDOQ289094
Authors: Xin Yan, Yanqin Bai 
Publication date: 27 May 2016
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-015-0843-4
Recommendations
- A new conic approach to semisupervised support vector machines
- On convergence rate of a convex relaxation of semisupervised support vector machines
- SDP relaxation for semi-supervised support vector machine
- A class of semi-supervised support vector machines by DC programming
- A proximal quadratic surface support vector machine for semi-supervised binary classification
completely positive programmingconvex conic relaxationdoubly nonnegative relaxationsemi-definite relaxationsemi-supervised support vector machines
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Semidefinite programming (90C22) Mixed integer programming (90C11)
Cites Work
- Support-vector networks
- Some NP-complete problems in quadratic and nonlinear programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Optimization techniques for semi-supervised support vector machines
- On Doubly Positive Semidefinite Programming Relaxations
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Support vector machine polyhedral separability in semisupervised learning
- New SDP models for protein homology detection with semi-supervised SVM
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consensus proximal support vector machine for classification problems with sparse solutions
- SDP relaxation for semi-supervised support vector machine
- Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
- Burer's key assumption for semidefinite and doubly nonnegative relaxations
Cited In (6)
- A proximal quadratic surface support vector machine for semi-supervised binary classification
- A new branch-and-bound approach to semi-supervised support vector machine
- SDP relaxation for semi-supervised support vector machine
- A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis
- Corporate and personal credit scoring via fuzzy non-kernel SVM with fuzzy within-class scatter
- A new conic approach to semisupervised support vector machines
Uses Software
This page was built for publication: Conic relaxations for semi-supervised support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289094)
