Abstract
Most literature on support vector machines (SVMs) concentrates on the dual optimization problem. In this letter, we point out that the primal problem can also be solved efficiently for both linear and nonlinear SVMs and that there is no reason for ignoring this possibility. On the contrary, from the primal point of view, new families of algorithms for large-scale SVM training can be investigated.
Issue Section:
Letters
This content is only available as a PDF.
© 2007 Massachusetts Institute of Technology
2007
You do not currently have access to this content.