Massive data discrimination via linear support vector machines

DOI10.1080/10556780008805771zbMath0986.90085OpenAlexW2091143818WikidataQ123134528 ScholiaQ123134528MaRDI QIDQ4954021

P. S. Bradley, Olvi L. Mangasarian

Publication date: 17 May 2000

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780008805771

zbMATH Keywords

linear programmingsupport vector machines

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (32)

Least squares twin support vector machine classification via maximum one-class within class variance ⋮ Massive data classification via unconstrained support vector machines ⋮ Approximate functions in a problem of sets separation ⋮ Max–min separability ⋮ Error Analysis of Coefficient-Based Regularized Algorithm for Density-Level Detection ⋮ A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach ⋮ High dimensional data classification and feature selection using support vector machines ⋮ Margin optimal classification trees ⋮ FEATURE SELECTION VIA LEAST SQUARES SUPPORT FEATURE MACHINE ⋮ Efficient and robust TWSVM classification via a minimum L1-norm distance metric criterion ⋮ Chunking for massive nonlinear kernel classification ⋮ Exploring the trade-off between generalization and empirical errors in a one-norm SVM ⋮ Quantile regression with \(\ell_1\)-regularization and Gaussian kernels ⋮ Analysis of programming properties and the row-column generation method for 1-norm support vector machines ⋮ A new method for solving supervised data classification problems ⋮ Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder) ⋮ Dual margin approach on a Lagrangian support vector machine ⋮ Optimization approaches to supervised classification ⋮ Evolution strategies based adaptive \(L_{p}\) LS-SVM ⋮ Learning errors of linear programming support vector regression ⋮ SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming ⋮ On the sparseness of 1-norm support vector machines ⋮ Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions ⋮ Optimization problems for machine learning: a survey ⋮ Multicategory proximal support vector machine classifiers ⋮ Polyhedral separability through successive LP ⋮ Least Square Regression with l^p-Coefficient Regularization ⋮ Multicategory proximal support vector machine classifiers ⋮ Spherical classification of data, a new rule-based learning method ⋮ MONOTONIC SUPPORT VECTOR MACHINES FOR CREDIT RISK RATING ⋮ Fast semi-supervised SVM classifiers usinga priorimetric information ⋮ Learning sparse classifiers with difference of convex functions algorithms

Uses Software

• MINOS

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• Breast Cancer Diagnosis and Prognosis Via Linear Programming
• Linear and Nonlinear Separation of Patterns by Linear Programming

This page was built for publication: Massive data discrimination via linear support vector machines