46 search results - page 1 / 10 » Using Analytic QP and Sparseness to Speed Training of Suppor... |
NIPS
1998
13 years 6 months ago
1998
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) problem. This paper proposes an algorithm for training SVMs: Sequential Mi...
ICPR
2000
IEEE
13 years 9 months ago
2000
IEEE
In the recent years support vector machines (SVMs) have been successfully applied to solve a large number of classification problems. Training an SVM, usually posed as a quadrati...
ANNPR
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
ICANN
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
ACL
2011
12 years 8 months ago
2011
Graph-based dependency parsing can be sped up significantly if implausible arcs are eliminated from the search-space before parsing begins. State-of-the-art methods for arc filt...