scientific article; zbMATH DE number 5957430

zbMATH Open1222.90041MaRDI QIDQ3174081FDOQ3174081

Authors: Nikolas List, Hans Ulrich Simon 

Publication date: 12 October 2011

Full work available at URL: http://www.jmlr.org/papers/v8/list07a.html

Title of this publication is not available (Why is that?)

Recommendations

• Learning Theory
• Polynomial decompositions in polynomial time
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms
• Algorithms related to the decomposition of polynomials
• scientific article; zbMATH DE number 4101330
• scientific article
• A polynomial time algorithm for computing all minimal decompositions of a polynomial
• New algorithms for exact and approximate polynomial decomposition
• Algorithmic aspects of a general modular decomposition theory

zbMATH Keywords

support vector machinesdecomposition algorithmsconvex quadratic optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Convex programming (90C25)

Cited In (8)

• Kernel methods in system identification, machine learning and function estimation: a survey
• Learning Theory
• Generalized SMO-Style Decomposition Algorithms
• Radial kernels and their reproducing kernel Hilbert spaces
• Algorithmic Learning Theory
• On the complexity of working set selection
• QP algorithms with guaranteed accuracy and run time for support vector machines
• Primal and dual predicted decrease approximation methods

This page was built for publication:

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