.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
nu-support vector classification (nu-SVC)
finite convergence
lower upper decomposition
solution path
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.9
Papers:
7.5K
Citations:
7.2W
