Journal article · 2003 · Open access
Benchmarking Least Squares Support Vector Machine Classifiers
Machine Learning, 54(1), 5–32 · Published 16 December 2003 · DOI 10.1023/b:mach.0000008082.80494.e0
In brief
“Benchmarking Least Squares Support Vector Machine Classifiers” is a 2003 journal article by Tony Van Gestel and 7 co-authors, published in Machine Learning. OpenAlex counts 785 citations as of 22 November 2026, which puts it in the top 1% of works published in 2003 by citations. It is open access under a public domain licence: the full text is free to read at Machine Learning.
- Citations
- 785
- Most cited in
- 2019 (42)
- Field-weighted impact
- 17.73
- References
- 73
- Authors
- 8
Abstract
In Support Vector Machines (SVMs), the solution of the classification problem is characterized by a (convex) quadratic programming (QP) problem. In a modified version of SVMs, called Least Squares SVM classifiers (LS-SVMs), a least squares cost function is proposed so as to obtain a linear set of equations in the dual space. While the SVM classifier has a large margin interpretation, the LS-SVM formulation is related in this paper to a ridge regression approach for classification with binary targets and to Fisher's linear discriminant analysis in the feature space. Multiclass categorization problems are represented by a set of binary classifiers using different output coding schemes. While regularization is used to control the effective number of parameters of the LS-SVM classifier, the sparseness property of SVMs is lost due to the choice of the 2-norm. Sparseness can be imposed in a second stage by gradually pruning the support value spectrum and optimizing the hyperparameters during the sparse approximation procedure. In this paper, twenty public domain benchmark datasets are used to evaluate the test set performance of LS-SVM classifiers with linear, polynomial and radial basis function (RBF) kernels. Both the SVM and LS-SVM classifier with RBF kernel in combination with standard cross-validation procedures for hyperparameter selection achieve comparable test set performances. These SVM and LS-SVM performances are consistently very good when compared to a variety of methods described in the literature including decision tree based algorithms, statistical algorithms and instance based learning methods. We show on ten UCI datasets that the LS-SVM sparse approximation procedure can be successfully applied.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Van Gestel, T., Suykens, J. A. K., Baesens, B., Viaene, S., Vanthienen, J., Dedene, G., De Moor, B., & Vandewalle, J. P. L. (2003). Benchmarking Least Squares Support Vector Machine Classifiers. Machine Learning, 54(1), 5–32. https://doi.org/10.1023/b:mach.0000008082.80494.e0
MLA 9
Van Gestel, Tony, et al. “Benchmarking Least Squares Support Vector Machine Classifiers.” Machine Learning, vol. 54, no. 1, 2003, pp. 5–32. https://doi.org/10.1023/b:mach.0000008082.80494.e0.
Chicago
Van Gestel, Tony, Johan A. K. Suykens, Bart Baesens, Stijn Viaene, Jan Vanthienen, Guido Dedene, Bart De Moor, and Joos P. L. Vandewalle. 2003. “Benchmarking Least Squares Support Vector Machine Classifiers.” Machine Learning 54 (1): 5–32. https://doi.org/10.1023/b:mach.0000008082.80494.e0.
Harvard
Van Gestel, T. et al. (2003) ‘Benchmarking Least Squares Support Vector Machine Classifiers’, Machine Learning, 54(1), pp. 5–32. doi:10.1023/b:mach.0000008082.80494.e0.
IEEE
T. Van Gestel et al., “Benchmarking Least Squares Support Vector Machine Classifiers,” Machine Learning, vol. 54, no. 1, pp. 5–32, 2003, doi: 10.1023/b:mach.0000008082.80494.e0.
BibTeX
@article{vangestel2003benchmarking,
title = {{Benchmarking Least Squares Support Vector Machine Classifiers}},
author = {Van Gestel, Tony and Suykens, Johan A. K. and Baesens, Bart and Viaene, Stijn and Vanthienen, Jan and Dedene, Guido and De Moor, Bart and Vandewalle, Joos P. L.},
journal = {Machine Learning},
year = {2003},
volume = {54},
number = {1},
pages = {5--32},
doi = {10.1023/b:mach.0000008082.80494.e0},
url = {https://doi.org/10.1023/b:mach.0000008082.80494.e0}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 38 | |
| 2018 | 40 | |
| 2019 | 42 | |
| 2020 | 31 | |
| 2021 | 36 | |
| 2022 | 28 | |
| 2023 | 20 | |
| 2024 | 16 | |
| 2025 | 11 | |
| 2026 | 10 |
Its field-weighted citation impact is 17.73: it has been cited 17.73 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
- least squares support vector machine
- support vector classifier
- benchmarking
- sparse approximation
- hyperparameter optimization
- ridge regression
- linear discriminant analysis
- output coding
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Van Gestel, T., Suykens, J. A. K., Baesens, B., Viaene, S., Vanthienen, J., Dedene, G., De Moor, B., & Vandewalle, J. P. L. (2003). Benchmarking Least Squares Support Vector Machine Classifiers. Machine Learning, 54(1), 5–32. https://doi.org/10.1023/b:mach.0000008082.80494.e0
How many times has this paper been cited?
785 times, according to OpenAlex on 22 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Machine Learning: sign in and open the PDF from this page.
Who wrote this paper?
Tony Van Gestel, Johan A. K. Suykens, Bart Baesens, Stijn Viaene, Jan Vanthienen, Guido Dedene, Bart De Moor, Joos P. L. Vandewalle.
What is the DOI of this paper?
10.1023/b:mach.0000008082.80494.e0, permanently at https://doi.org/10.1023/b:mach.0000008082.80494.e0. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 22 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.