Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Lin, C.-J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Lin, C.-J.
(Neural Computation. 2001;13:307-317.)
© 2001 The MIT Press


Note

Formulations of Support Vector Machines: A Note from an Optimization Point of View

Chih-Jen Lin

Department of Computer Science and Information Engineering, National Taiwan University, Taipei 106, Taiwan

In this article, we discuss issues about formulations of support vector machines (SVM) from an optimization point of view. First, SVMs map training data into a higher- (maybe infinite-) dimensional space. Currently primal and dual formulations of SVM are derived in the finite dimensional space and readily extend to the infinite-dimensional space. We rigorously discuss the primal-dual relation in the infinite-dimensional spaces. Second, SVM formulations contain penalty terms, which are different from unconstrained penalty functions in optimization. Traditionally unconstrained penalty functions approximate a constrained problem as the penalty parameter increases. We are interested in similar properties for SVM formulations. For two of the most popular SVM formulations, we show that one enjoys properties of exact penalty functions, but the other is only like traditional penalty functions, which converge when the penalty parameter goes to infinity.




This article has been cited by other articles:


Home page
Neural Comput.Home page
M.-W. Chang and C.-J. Lin
Leave-One-Out Bounds for Support Vector Regression Model Selection
Neural Comput., May 1, 2005; 17(5): 1188 - 1222.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
S. S. Keerthi and C.-J. Lin
Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
Neural Comput., July 1, 2003; 15(7): 1667 - 1689.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
C.-C. Chang and C.-J. Lin
Training {nu}-Support Vector Classifiers: Theory and Algorithms
Neural Comput., September 1, 2001; 13(9): 2119 - 2147.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2001 by The MIT Press.