.png){kind=icon}
返回
Regularization Path for ν-Support Vector Classification
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2012.2183644.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The nu-support vector classification (nu-SVC) proposed by Scholkopf et al. has the advantage of using a regularization parameter. for controlling the number of support vectors and margin errors. However, compared to C-SVC, its formulation is more complicated, and to date there are no effective methods for computing its regularization path. In this paper, we propose a new regularization path algorithm, which is designed on the basis of a modified formulation of nu-SVC and traces the solution path with respect to the parameter.. Through theoretical analysis and confirmatory experiments, we show that our algorithm can avoid the infeasible updating path under several assumptions (i.e., Assumptions 1 and 2), and fit the entire solution path in a finite number of steps. When the regularization path of nu-SVC is available, a novel approach proposed by Yang and Ong can be applied to obtain the global optimal solution of common validation functions for nu-SVC, and the computation for the whole process is minimal. Numerical experiments show that it is more efficient than various kinds of grid search methods for selecting the optimal regularization parameter nu.
Keyword:
Model selection
nu-support vector classification regularization
solution path
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.7K
被引数:
7.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容