Exploring the trade-off between generalization and empirical errors in a one-norm SVM

DOI10.1016/j.ejor.2011.11.037zbMath1244.90260MaRDI QIDQ439563

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

zbMATH Keywords

data mining; support vector machines; multiple objective programming; one-norm; regularization path

Mathematics Subject Classification ID

62H30: Classification and discrimination; cluster analysis (statistical aspects)

90C90: Applications of mathematical programming

90C29: Multi-objective and goal programming

68T05: Learning and adaptive systems in artificial intelligence

Uses Software

• UCI-ml
• CPLEX
• LIBSVM
• ElemStatLearn

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiobjective optimization. Interactive and evolutionary approaches
• Vector maximization with two objective functions
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Multi-objective machine learning
• Knowledge based proximal support vector machines
• Finding representative systems for discrete bicriterion optimization problems
• The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
• A Parametric Quadratic Program to Solve A Class of Bicriteria Decision Problems
• Sparsity and Smoothness Via the Fused Lasso
• Massive data discrimination via linear support vector machines
• L 1-Regularization Path Algorithm for Generalized Linear Models
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Linear programming boosting via column generation