Support vector machine polyhedral separability in semisupervised learning
From MaRDI portal
Publication:2342142
Recommendations
- Semisupervised spherical separation
- Data preprocessing in semi-supervised SVM classification
- Optimization techniques for semi-supervised support vector machines
- A proximal quadratic surface support vector machine for semi-supervised binary classification
- A new conic approach to semisupervised support vector machines
Cites work
- 10.1162/153244303765208403
- A novel piecewise linear classifier based on polyhedral conic and max-min separabilities
- Accurately learning from few examples with a polyhedral classifier
- An introduction to support vector machines and other kernel-based learning methods.
- Binary classification via spherical separator by DC programming and DCA
- Choosing multiple parameters for support vector machines
- Classification through incremental max-min separability
- Conic separation of finite sets. I: The homogeneous case
- Data preprocessing in semi-supervised SVM classification
- DC models for spherical separation
- Ellipsoidal separation for classification problems
- scientific article; zbMATH DE number 5957380 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Margin maximization in spherical separation
- Max–min separability
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Non-smoothness in classification problems
- On the complexity of polyhedral separability
- Optimization techniques for semi-supervised support vector machines
- Polyhedral separability through successive LP
- Separation via polyhedral conic functions
Cited in
(25)- A proximal quadratic surface support vector machine for semi-supervised binary classification
- A new branch-and-bound approach to semi-supervised support vector machine
- DC programming and DCA: thirty years of developments
- A new conic approach to semisupervised support vector machines
- A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis
- Polyhedral separation via difference of convex (DC) programming
- A characterization of 2-threshold functions via pairs of prime segments
- Semisupervised spherical separation
- Accurately learning from few examples with a polyhedral classifier
- Conic relaxations for semi-supervised support vector machines
- Data preprocessing in semi-supervised SVM classification
- Approximate functions in a problem of sets separation
- Non-smoothness in classification problems
- Unsupervised classification via convex absolute value inequalities
- Nonlinear optimization and support vector machines
- Nonlinear optimization and support vector machines
- Hierarchical learning in polynomial support vector machines
- Maximum-margin polyhedral separation for binary multiple instance learning
- A classification method based on a cloud of spheres
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem
- Difference of Convex programming in adversarial SVM
- New interior-point approach for one- and two-class linear support vector machines using multiple variable splitting
- Predicting pairwise interaction affinities with ℓ 0 -penalized least squares–a nonsmooth bi-objective optimization based approach*
- Separability of set-valued data sets and existence of support hyperplanes in the support function machine
This page was built for publication: Support vector machine polyhedral separability in semisupervised learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2342142)
