A multi-class SVM approach based on the \( l_1\)-norm minimization of the distances between the reduced convex hulls
From MaRDI portal
Publication:1677845
DOI10.1016/j.patcog.2014.12.006zbMath1374.68367OpenAlexW2060584901MaRDI QIDQ1677845
Sebastián Maldonado, Miguel Carrasco, Julio López
Publication date: 13 November 2017
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2014.12.006
Related Items (2)
Multi-class support vector machine classifiers using intrinsic and penalty graphs ⋮ Double regularization methods for robust feature selection and SVM classification via DC programming
Uses Software
Cites Work
- Pegasos: primal estimated sub-gradient solver for SVM
- Alternative second-order cone programming formulations for support vector classification
- Linear programming support vector machines
- An approach to nonlinear programming
- A Bayesian analysis of some nonparametric problems
- Imbalanced data classification using second-order cone programming support vector machines
- 10.1162/15324430260185628
- AD-SVMs: A light extension of SVMs for multicategory classification1
- Multicategory Support Vector Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A multi-class SVM approach based on the \( l_1\)-norm minimization of the distances between the reduced convex hulls