Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 449

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

A Robust Regularization Path Algorithm for $\nu $ -Support Vector Classification

Gu, Bin, Sheng, Victor S.·2017·IEEE Transactions on Neural Networks and Learning Systems

Abstract

The ν -support vector classification has the advantage of using a regularization parameter ν to control the number of support vectors and margin errors. Recently, a regularization path algorithm for ν -support vector classification ( ν -SvcPath) suffers exceptions and singularities in some special cases. In this brief, we first present a new equivalent dual formulation for ν -SVC and, then, propose a robust ν -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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tnnls.2016.2527796

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Research works printed but not linked: 18

  1. 10.1109/TNNLS.2013.2262180 · DOI
  2. poole, 2014, Linear Algebra A Modern Introduction
  3. vapnik, 1998, Statistical Learning Theory
  4. luenberger, 1973, Introduction to Linear and Nonlinear Programming, 28
  5. householder, 1974, The Theory of Matrices in Numerical Analysis
  6. bache, 2013, UCI Machine Learning Repository
  7. 10.1145/2608628.2608664 · DOI · Paper page
  8. 10.1109/TGRS.2013.2281854 · doi:10.1109/tgrs.2013.2281854
  9. wen, 2015, Efficient feature selection and classification for vehicle detection, IEEE Trans Circuits Syst Video Technol, 25, 508, 10.1109/TCSVT.2014.2358031 · DOI
  10. hastie, 2004, The entire regularization path for the support vector machine, J Mach Learn Res, 5, 1391
  11. gu, 2012, Regularization path for $\nu $ -support vector classification, IEEE Trans Neural Netw Learn Syst, 23, 800, 10.1109/TNNLS.2012.2183644 · doi:10.1109/tnnls.2012.2183644
  12. 10.1162/neco.2007.19.6.1633 · DOI
  13. bach, 2006, Considering cost asymmetry in learning classifiers, J Mach Learn Res, 7, 1713
  14. ong, 2010, An improved algorithm for the solution of the regularization path of support vector machine, IEEE Trans Neural Netw, 21, 451, 10.1109/TNN.2009.2039000 · DOI
  15. 10.1162/neco.2008.10-07-628 · doi:10.1162/neco.2008.10-07-628
  16. schölkopf, 2001, Learning With Kernels Support Vector Machines Regularization Optimization and Beyond, 10.7551/mitpress/4175.001.0001 · DOI · Paper page
  17. 10.1162/089976600300015565 · DOI
  18. 10.1214/11-AOS878 · DOI · Paper page

Cited by

See all 449

Metadata

Authors
Gu, B., & Sheng, V. S.
Venue
IEEE Transactions on Neural Networks and Learning Systems
Published
2017-05
Volume
28
Issue
5
Pages
1241-1248
ISSN
  • 2162-237X (ISSN-L)
  • 2162-2388
OpenAlex
W2288560581
Cited by
449
References
1
FWCI
110.65
Type
journal article
Language
en
Open access
closed
Funders
  • National Natural Science Foundation of China (61232016, 61202137, 61573191)
  • U.S. National Science Foundation (IIS-1115417)
  • Priority Academic Program Development, Jiangsu Higher Education Institutions

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Robust Regularization Path Algorithm for $\nu $ -Support Vector Classification. https://app.cochat.ai/papers/10.1109/tnnls.2016.2527796
The paper
Gu, B., & Sheng, V. S. (2017). A Robust Regularization Path Algorithm for $\nu $ -Support Vector Classification. IEEE Transactions on Neural Networks and Learning Systems. https://doi.org/10.1109/tnnls.2016.2527796

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.