On the complexity of working set selection

DOI10.1016/j.tcs.2007.03.041zbMath1127.68087OpenAlexW2137530430MaRDI QIDQ2381582

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

decomposition methodsupport vector machinesapproximation algorithmsworking set selection

Mathematics Subject Classification ID

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

Related Items

Minimizing the error of linear separators on linearly inseparable data ⋮ Primal and dual predicted decrease approximation methods

Uses Software

• Knapsack
• LIBSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial-time decomposition algorithms for support vector machines
• Approximation algorithms for knapsack problems with cardinality constraints
• Training v-Support Vector Classifiers: Theory and Algorithms
• Reducibility Among Combinatorial Problems
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• 10.1162/15324430152748218
• A Note on the Decomposition Methods for Support Vector Regression
• Learning Theory
• Improvements to Platt's SMO Algorithm for SVM Classifier Design
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Algorithmic Learning Theory
• Learning Theory
• A simple decomposition method for support vector machines
• Feasible direction decomposition algorithms for training support vector machines
• Convergence of a generalized SMO algorithm for SVM classifier design