An iterative algorithm learning the maximal margin classifier.
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 597906 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- scientific article; zbMATH DE number 3189712 (Why is no real title available?)
- An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
- Finding the Point of a Polyhedron Closest to the Origin
- Ten lectures on statistical and structural pattern recognition.
- Theoretical foundations of the potential function method in pattern recognition learning
Cited in
(12)- An evolutionary algorithm for large margin classification
- An effective method to determine whether a point is within a convex hull and its generalized convex polyhedron classifier
- A \(\nu \)-twin support vector machine (\(\nu \)-TSVM) classifier and its geometric algorithms
- Efficient implicit Lagrangian twin parametric insensitive support vector regression via unconstrained minimization problems
- A regression based approach to a maximum margin classifier for separation of linearly inseparable pattern classes
- CCH-based geometric algorithms for SVM and applications
- Clipping algorithms for solving the nearest point problem over reduced convex hulls
- Linear convergence rate for the MDM algorithm for the nearest point problem
- Class imbalance learning using fuzzy ART and intuitionistic fuzzy twin support vector machines
- A theorem on strict separability of convex polyhedra and its applications in optimization
- 10.1162/15324430260185600
- A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
This page was built for publication: An iterative algorithm learning the maximal margin classifier.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400483)