The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
A Robust Regularization Path Algorithm for $\nu $ -Support Vector Classification
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,411
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
(1999) · doi:10.1162/089976600300015565 · Cited by 2,799
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
(2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.848998 · Cited by 2,225
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
THE THEORY OF MATRICES IN NUMERICAL ANALYSIS
Mirsky, L. (1965) · Journal of the London Mathematical Society · doi:10.1112/jlms/s1-40.1.378b · Cited by 1,148
Powers of tensors and fast matrix multiplication
Le Gall, F. (2014) · Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation · doi:10.1145/2608628.2608664 · Cited by 856
The Entire Regularization Path for the Support Vector Machine
Hastie, T. J., Rosset, S., Tibshirani, R. J., & Zhu, J. (2004) · Cited by 607
The solution path of the generalized lasso
Tibshirani, R. J., & Taylor, J. (2011) · The Annals of Statistics · doi:10.1214/11-aos878 · Cited by 553
Linear Algebra: A Modern Introduction
Poole, D. (2002) · Medical Entomology and Zoology · Cited by 254
Efficient Feature Selection and Classification for Vehicle Detection
Wen, X., Shao, L., Fang, W., & Xue, Y. (2015) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2014.2358031 · Cited by 178
Considering Cost Asymmetry in Learning Classifiers
Bach, F., Heckerman, D. E., & Horvitz, E. (2005) · Journal of Machine Learning Research · doi:10.5555/1248547.1248610 · Cited by 120
Efficient Computation and Model Selection for the Support Vector Regression
Gunter, L., & Zhu, J. (2007) · Neural Computation · doi:10.1162/neco.2007.19.6.1633 · Cited by 61
An Improved Algorithm for the Solution of the Regularization Path of Support Vector Machine
Ong, C., Shao, S., & Yang, J. (2010) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2009.2039000 · Cited by 55
Dai, J., Chang, C., Mai, F., et al. (2013) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2013.2262180 · Cited by 17
Research works printed but not linked: 3
- 10.1109/TGRS.2013.2281854 · doi:10.1109/tgrs.2013.2281854
- 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
- 10.1162/neco.2008.10-07-628 · doi:10.1162/neco.2008.10-07-628
Cited by
Energy-Efficient Offloading for Mobile Edge Computing in 5G Heterogeneous Networks
Zhang, K., Mao, Y., Leng, S., Zhao, Q., Li, L., Peng, X., Pan, L., Maharjan, S., & Zhang, Y. (2016) · IEEE Access · doi:10.1109/access.2016.2597169 · Cited by 855
Ahmad, T., Madonski, R., Zhang, D., Huang, C., & Mujeeb, A. (2022) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2022.112128 · Cited by 711
A novel intelligent diagnosis method using optimal LS-SVM with improved PSO algorithm
Deng, W., Yao, R., Zhao, H., Yang, X., & Li, G. (2019) · Soft Computing · doi:10.1007/s00500-017-2940-9 · Cited by 490
Study on an improved adaptive PSO algorithm for solving multi-objective gate assignment
Deng, W., Zhao, H., Yang, X., Xiong, J., Sun, M., & Li, B. (2017) · Applied Soft Computing · doi:10.1016/j.asoc.2017.06.004 · Cited by 364
A hybrid feature selection algorithm for gene expression data classification
Lu, H., Chen, J., Yan, K., Jin, Q., Xue, Y., & Gao, Z. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.07.080 · Cited by 354
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
- 17
- FWCI
- 110.65
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- 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
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.