.png){kind=icon}
返回
A Robust Regularization Path Algorithm for ν-Support Vector Classification
.png){kind=icon}
OA
AI
DOI：10.1109/TNNLS.2016.2527796.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The nu-support vector classification has the advantage of using a regularization parameter nu to control the number of support vectors and margin errors. Recently, a regularization path algorithm for nu-support vector classification (nu-SvcPath) suffers exceptions and singularities in some special cases. In this brief, we first present a new equivalent dual formulation for nu-SVC and, then, propose a robust nu-SvcPath, based on lower upper decomposition with partial pivoting. Theoretical analysis and experimental results verify that our proposed robust regularization path algorithm can avoid the exceptions completely, handle the singularities in the key matrix, and fit the entire solution path in a finite number of steps. Experimental results also show that our proposed algorithm fits the entire solution path with fewer steps and less running time than original one does.
Keyword:
nu-support vector classification (nu-SVC)
finite convergence
lower upper decomposition
solution path
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容