Exact simplification of support vector solutions
The DOI matches its OpenAlex record.
Abstract
This paper demonstrates that standard algorithms for training support vector machines generally produce solutions with a greater number of support vectors than are strictly necessary. An algorithm is presented that allows unnecessary support vectors to be recognized and eliminated while leaving the solution otherwise unchanged. The algorithm is applied to a variety of benchmark data sets (for both classification and regression) and in most cases the procedure leads to a reduction in the number of support vectors. In some cases the reduction is substantial.
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
Cited by
The Kernel Recursive Least-Squares Algorithm
Engel, Y., Mannor, S., & Meir, R. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830985 · Cited by 1,104
Support Vector Machines for Classification
Awad, M., & Khanna, R. (2015) · Efficient Learning Machines · doi:10.1007/978-1-4302-5990-9_3 · Cited by 543
Incremental on-line learning: A review and comparison of state of the art algorithms
Losing, V., Hammer, B., & Wersing, H. (2018) · Neurocomputing · doi:10.1016/j.neucom.2017.06.084 · Cited by 382
Applications of Support Vector Machines in Chemistry
Ivanciuc, O. (2007) · Reviews in Computational Chemistry · doi:10.1002/9780470116449.ch6 · Cited by 384
High dimensional data classification and feature selection using support vector machines
Ghaddar, B., & Naoum-Sawaya, J. (2018) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.08.040 · Cited by 334
Fast exact leave-one-out cross-validation of sparse least-squares support vector machines
Cawley, G. C., & Talbot, N. L. C. (2004) · Neural Networks · doi:10.1016/j.neunet.2004.07.002 · Cited by 332
Efficient support vector classifiers for named entity recognition
Isozaki, H., & Kazawa, H. (2002) · Proceedings of the 19th international conference on Computational linguistics - · doi:10.3115/1072228.1072282 · Cited by 329
The cross entropy method for classification
Mannor, S., Peleg, D., & Rubinstein, R. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102422 · Cited by 312
Building Support Vector Machines with Reduced Classifier Complexity
Keerthi, S. S., Chapelle, O., & DeCoste, D. (2006) · MPG.PuRe (Max Planck Society) · doi:10.5555/1248547.1248602 · Cited by 263
A Lightweight YOLOv2: A Binarized CNN with A Parallel Support Vector Regression for an FPGA
Nakahara, H., Yonekawa, H., Fujii, T., & Sato, S. (2018) · Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays · doi:10.1145/3174243.3174266 · Cited by 139
Metadata
- Authors
- Downs, T., Gates, K. E., & Masters, A. L.
- Published
- 2002-03-01
- Volume
- 2
- Issue
- 2
- Pages
- 293-297
- DOI
- 10.5555/944790.944814
- OpenAlex
- W2156135142
- Cited by
- 195
- References
- 0
- FWCI
- 8.36
- Type
- journal article
- Language
- en
- Open access
- closed
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.