Margin maximization in spherical separation
From MaRDI portal
Recommendations
Cites work
- 10.1162/15324430260185583
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- An introduction to support vector machines and other kernel-based learning methods.
- DC models for spherical separation
- Ellipsoidal separation for classification problems
- scientific article; zbMATH DE number 1314294 (Why is no real title available?)
- scientific article; zbMATH DE number 1836463 (Why is no real title available?)
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- Max–min separability
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- On the convergence of a modified version of SVMlightalgorithm
- Polyhedral separability through successive LP
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Working set selection using second order information for training support vector machines
Cited in
(28)- DC programming and DCA: thirty years of developments
- A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming
- A maximum-margin multisphere approach for binary multiple instance learning
- Polyhedral separation via difference of convex (DC) programming
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- Classification in the multiple instance learning framework via spherical separation
- Spherical separation with infinitely far center
- An illumination problem: optimal apex and optimal orientation for a cone of light
- Semisupervised spherical separation
- Support vector machine polyhedral separability in semisupervised learning
- Optimal replenishment order placement in a finite time horizon
- Edge detection by spherical separation
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- On numerical solving the spherical separability problem
- Multi-instance classification through spherical separation and VNS
- Maximal Balls of Linearly Separable Sets
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- A DC optimization-based clustering technique for edge detection
- Stochastic sub-sampled Newton method with variance reduction
- A splitting bundle approach for non-smooth non-convex minimization
- Robust spherical separation
- The separating spherical belt with the maximum ratio of radii
- DC models for spherical separation
- Partitional clustering via successive transportation problems
- Ellipsoidal classification via semidefinite programming
- A classification method based on a cloud of spheres
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- An incremental piecewise linear classifier based on polyhedral conic separation
This page was built for publication: Margin maximization in spherical separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928756)
