Exploring the trade-off between generalization and empirical errors in a one-norm SVM
DOI10.1016/J.EJOR.2011.11.037zbMATH Open1244.90260OpenAlexW2025047988MaRDI QIDQ439563FDOQ439563
Authors: Haldun Aytug, Serpil Sayın 
Publication date: 16 August 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.037
Recommendations
- scientific article
- Support vector machines with different norms: Motivation, formulations and results
- scientific article; zbMATH DE number 5957245
- A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
- An error bound for \(L_1\)-norm support vector machine coefficients in ultra-high dimension
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Multi-objective and goal programming (90C29) Applications of mathematical programming (90C90)
Cites Work
- Sparsity and Smoothness Via the Fused Lasso
- L 1-Regularization Path Algorithm for Generalized Linear Models
- Boosting as a regularized path to a maximum margin classifier
- Title not available (Why is that?)
- Title not available (Why is that?)
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- Title not available (Why is that?)
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- Multiobjective optimization. Interactive and evolutionary approaches
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Finding representative systems for discrete bicriterion optimization problems
- Title not available (Why is that?)
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Linear programming boosting via column generation
- Massive data discrimination via linear support vector machines
- Multi-objective machine learning
- Vector maximization with two objective functions
- Knowledge based proximal support vector machines
- A Parametric Quadratic Program to Solve A Class of Bicriteria Decision Problems
Cited In (2)
Uses Software
This page was built for publication: Exploring the trade-off between generalization and empirical errors in a one-norm SVM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439563)
