This paper presents the v-SVM and the ν-SVR full regularizaron paths along with a leave-one-out inspired stopping criterion and an efficient implementation. In the ν-SVR method, two parameters are provided by the user: the regularization parameter C and ν which settles the width of the ε-tube. In the classical ν-SVM method, parameter v is an lower bound on the number of support vectors in the solution. Based on the previous works of [1,2], extensions of regularization paths for SVM and SVR are proposed and permit to automatically compute the solution path by varying ν or the regularization parameter. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Loosli, G., Gasso, G., & Canu, S. (2007). Regularization paths for ν-SVM and ν-SVR. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4493 LNCS, pp. 486–496). Springer Verlag. https://doi.org/10.1007/978-3-540-72395-0_62
Mendeley helps you to discover research relevant for your work.