On the sparseness of 1-norm support vector machines

DOI10.1016/J.NEUNET.2009.11.012zbMATH Open1396.68109OpenAlexW1993105429WikidataQ37657911 ScholiaQ37657911MaRDI QIDQ1784565FDOQ1784565

Authors Li Zhang, WeiDa Zhou

Publication date 27 September 2018

Published in Neural Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.neunet.2009.11.012

zbMATH Keywords

sparse learningsparseness1-norm SVMstandard SVM

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• 1-norm support vector novelty detection and its sparseness
• 10.1162/1532443041827925
• A sparse least squares support vector machine
• OnL₁-Norm Multiclass Support Vector Machines
• Sparse support vector machines in reproducing kernel Banach spaces
• A novel sparse least squares support vector machines
• Non-asymptotic Analysis of $\ell_1$-norm Support Vector Machines
• scientific article; zbMATH DE number 5430994

Cites work

• scientific article; zbMATH DE number 439946 (Why is no real title available?)
• scientific article; zbMATH DE number 5430994 (Why is no real title available?)
• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• 10.1162/15324430260185637
• 10.1162/153244303322753643
• 10.1162/1532443041827925
• A feature selection Newton method for support vector machine classification
• A simple proof of the restricted isometry property for random matrices
• Approximation and learning by greedy algorithms
• Compressed sensing
• Compressed sensing and best \(k\)-term approximation
• Decoding by Linear Programming
• Deterministic constructions of compressed sensing matrices
• Kernel matching pursuit
• Least angle regression. (With discussion)
• Linear programming boosting via column generation
• Linear programming support vector machines
• Linear programming: foundations and extensions
• Massive data discrimination via linear support vector machines
• Matching pursuits with time-frequency dictionaries
• OnL₁-Norm Multiclass Support Vector Machines
• Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
• Stable signal recovery from incomplete and inaccurate measurements
• Steepest-edge simplex algorithms for linear programming
• Structured variable selection in support vector machines

Cited in

(12)

• Sparse high-dimensional fractional-norm support vector machine via DC programming
• Tropical Support Vector Machines: Evaluations and Extension to Function Spaces
• Support vector machine classifiers by non-Euclidean margins
• A semismooth Newton method for support vector classification and regression
• Non-asymptotic Analysis of $\ell_1$-norm Support Vector Machines
• 10.1162/1532443041827925
• An error bound for \(L_1\)-norm support vector machine coefficients in ultra-high dimension
• Sparse ensembles using weighted combination methods based on linear programming
• scientific article; zbMATH DE number 5430994 (Why is no real title available?)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
• 1-norm support vector novelty detection and its sparseness
• Analysis of programming properties and the row-column generation method for 1-norm support vector machines

Describes a project that uses

Uses Software

• UCI
• LIBSVM

This page was built for publication: On the sparseness of 1-norm support vector machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784565)