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 Chang, C.-C.
Right arrow Articles by Lin, C.-J.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Chang, C.-C.
Right arrow Articles by Lin, C.-J.
(Neural Computation. 2001;13:2119-2147.)
© 2001 The MIT Press


Letter

Training {nu}-Support Vector Classifiers: Theory and Algorithms

Chih-Chung Chang

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

Chih-Jen Lin

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

The {nu}-support vector machine ({nu}-SVM) for classification proposed by Schölkopf, Smola, Williamson, and Bartlett (2000) has the advantage of using a parameter {nu} on controlling the number of support vectors. In this article, we investigate the relation between {nu}-SVM and C-SVM in detail. We show that in general they are two different problems with the same optimal solution set. Hence, we may expect that many numerical aspects of solving them are similar. However, compared to regular C-SVM, the formulation of {nu}-SVM is more complicated, so up to now there have been no effective methods for solving large-scale {nu}-SVM. We propose a decomposition method for {nu}-SVM that is competitive with existing methods for C-SVM. We also discuss the behavior of {nu}-SVM by some numerical experiments.




This article has been cited by other articles:


Home page
BioinformaticsHome page
S. Hirose, K. Shimizu, S. Kanai, Y. Kuroda, and T. Noguchi
POODLE-L: a two-level SVM prediction system for reliably predicting long disordered regions
Bioinformatics, August 15, 2007; 23(16): 2046 - 2053.
[Abstract] [Full Text] [PDF]


Home page
Mol Biol EvolHome page
Y.-S. Lin, W.-L. Hsu, J.-K. Hwang, and W.-H. Li
Proportion of Solvent-Exposed Amino Acids in a Protein and Rate of Protein Evolution
Mol. Biol. Evol., April 1, 2007; 24(4): 1005 - 1011.
[Abstract] [Full Text] [PDF]


Home page
Clin. Cancer Res.Home page
A. Schramm, J. Vandesompele, J. H. Schulte, S. Dreesmann, L. Kaderali, B. Brors, R. Eils, F. Speleman, and A. Eggert
Translating Expression Profiling into a Clinically Feasible Test to Predict Neuroblastoma Outcome
Clin. Cancer Res., March 1, 2007; 13(5): 1459 - 1465.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
F. Liang
An Effective Bayesian Neural Network Classifier with a Comparison Study to Support Vector Machine
Neural Comput., August 1, 2003; 15(8): 1959 - 1989.
[Abstract] [Full Text]


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 Regression: Theory and Algorithms
Neural Comput., August 1, 2002; 14(8): 1959 - 1977.
[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.