On the complexity of working set selection

DOI10.1016/J.TCS.2007.03.041MaRDI QIDQ2381582zbMATH OpenOpenAlexFDO

Authors Hans Ulrich Simon

Publication date 18 September 2007

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.03.041

zbMATH Keywords

support vector machinesapproximation algorithmsdecomposition methodworking set selection

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Convex programming (90C25) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Algorithmic Learning Theory
• Learning Theory
• scientific article; zbMATH DE number 5957430
• Maximum-gain working set selection for SVMs
• Learning Theory

Cites work

• scientific article; zbMATH DE number 3850828 (Why is no real title available?)
• scientific article; zbMATH DE number 1314294 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• 10.1162/15324430152748218
• A Note on the Decomposition Methods for Support Vector Regression
• A simple decomposition method for support vector machines
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Approximation algorithms for knapsack problems with cardinality constraints
• Convergence of a generalized SMO algorithm for SVM classifier design
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Feasible direction decomposition algorithms for training support vector machines
• Improvements to Platt's SMO Algorithm for SVM Classifier Design
• Learning Theory
• Learning Theory
• Polynomial-time decomposition algorithms for support vector machines
• QP algorithms with guaranteed accuracy and run time for support vector machines
• Reducibility among combinatorial problems
• Training \(\nu\)-support vector classifiers: Theory and algorithms

Cited in

(9)

• Learning Theory
• Minimizing the error of linear separators on linearly inseparable data
• A simple decomposition method for support vector machines
• On the working set selection in gradient projection-based decomposition techniques for support vector machines
• Algorithmic Learning Theory
• Maximum-gain working set selection for SVMs
• On the complexity of non-unique probe selection
• scientific article; zbMATH DE number 3980537 (Why is no real title available?)
• Primal and dual predicted decrease approximation methods

Describes a project that uses

Uses Software

• LIBSVM
• Knapsack

This page was built for publication: On the complexity of working set selection

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