The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Support Vector Machine Solvers
Abstract
Considerable efforts have been devoted to the implementation of efficient optimization method for solving the Support Vector Machine dual problem. This document proposes an historical perspective and and in depth review of the algorithmic and computational issues associated with this problem.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
Self-citationThe Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
A training algorithm for optimal margin classifiers
Boser, B. E., Guyon, I. M., & Vapnik, V. N. (1992) · Proceedings of the fifth annual workshop on Computational learning theory · doi:10.1145/130385.130401 · Cited by 11,992
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Estimating the Support of a High-Dimensional Distribution
Schölkopf, B., Platt, J. C., Shawe-Taylor, J., Smola, A. J., & Williamson, R. C. (2001) · Neural Computation · doi:10.1162/089976601750264965 · Cited by 6,168 · cited 2×
“…include SVMs for computing regressions (Vapnik, 1995), for solving integral equations (Vapnik, 1995), for estimating the support of a density (Schölkopf et al., 2001), SVMs that use different soft-margin costs (Cortes and Vapnik, 1995), and parameters (Schölkopf et al., 2000; Chang and…”
MethodFast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
Making Large-Scale SVM Learning Practical
Joachims, T. (1998) · RePEc: Research Papers in Economics · doi:10.17877/de290r-14262 · Cited by 4,411
(1999) · doi:10.1162/089976600300015565 · Cited by 2,799
Estimation of Dependences Based on Empirical Data
Vapnik, V. (2006) · Information Science and Statistics · doi:10.1007/0-387-34239-7 · Cited by 2,238
Working Set Selection Using Second Order Information for Training Support Vector Machines
Fan, R.-E., Chen, P.-H., & Lin, C. (2005) · Journal of Machine Learning Research · doi:10.5555/1046920.1194907 · Cited by 1,403
Self-citationImprovements to Platt's SMO Algorithm for SVM Classifier Design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2001) · Neural Computation · doi:10.1162/089976601300014493 · Cited by 1,318
Pattern recognition using generalized portrait method
Vapnik, V. N. (1963) · Automation and Remote Control · Cited by 1,151
Core Vector Machines: Fast SVM Training on Very Large Data Sets
Tsang, I. W.-H., Kwok, J. T.-Y., & Cheung, P.-M. (2005) · doi:10.5555/1046920.1058114 · Cited by 928
Fast Kernel Classifiers With Online And Active Learning
Bordes, A., Ertekin, Ş., Weston, J., & Bottou, L. (2005) · HAL · Cited by 749
Self-citationSupport Vector Machines: Training and Applications
Osuna, E., Freund, R. M., & Girosi, F. (1997) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 697
Comparison of classifier methods: a case study in handwritten digit recognition
Bottou, L., Cortes, C., Denker, J. S., Drucker, H., Guyon, I., Jackel, L. D., LeCun, Y., Muller, U. A., Sackinger, E., Simard, P., et al. (2002) · Proceedings of the 12th IAPR International Conference on Pattern Recognition (Cat. No.94CH3440-5) · doi:10.1109/icpr.1994.576879 · Cited by 626
Self-citationEfficient svm training using low-rank kernel representations
Fine, S., & Scheinberg, K. (2002) · doi:10.5555/944790.944812 · Cited by 579
Training v-Support Vector Classifiers: Theory and Algorithms
Chang, C.-C., & Lin, C.-J. (2001) · Neural Computation · doi:10.1162/089976601750399335 · Cited by 499
Self-citationCollobert, R., Sinz, F. H., Weston, J., & Bottou, L. (2006) · doi:10.5555/1248547.1248609 · Cited by 466
Self-citationLearning machines: foundations of trainable pattern-classifying systems
Nilsson, N. J. (1965) · Cited by 456
A fast iterative nearest point algorithm for support vector machine classifier design
Keerthi, S. S., Shevade, S. K., Bhattacharyya, C., & Murthy, K. R. K. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.822516 · Cited by 383
Bottou, L., & Cun, Y. L. (2003) · Cited by 359
Self-citationDuality and Geometry in SVM Classifiers
Bennett, K. P., & Bredensteiner, E. J. (2000) · Cited by 342
A Study on SMO-Type Decomposition Methods for Support Vector Machines
Chen, P.-H., Fan, R.-E., & Lin, C.-J. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.875973 · Cited by 339
Self-citationConvergence of a Generalized SMO Algorithm for SVM Classifier Design
Keerthi, S. S., & Gilbert, E. G. (2002) · Machine Learning · doi:10.1023/a:1012431217818 · Cited by 304
Vapnik, V. N. (1982) · Springer eBooks · Cited by 295
Fast rates for support vector machines using Gaussian kernels
Steinwart, I., & Scovel, C. (2007) · The Annals of Statistics · doi:10.1214/009053606000001226 · Cited by 258
On the convergence of the decomposition method for support vector machines
Lin, C.-J. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.963765 · Cited by 245
Self-citationThe analysis of decomposition methods for support vector machines
Chang, C.-C., Hsu, C., & Lin, C. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.857780 · Cited by 160
Self-citationSupport Vector Machine Reference Manual
Saunders, C. J., Mo, W. S., Schölkopf Bottou, L., & Smola, A. J. (1998) · ePrints Soton (University of Southampton) · Cited by 148
Efficient Kernel Machines Using the Improved Fast Gauss Transform
Yang, C., Ramani Duraiswami, B., & Davis, L. S. (2004) · Cited by 123
A formal analysis of stopping criteria of decomposition methods for support vector machines
Lin, C. (2002) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2002.1031937 · Cited by 84
Self-citationPolynomial-Time Decomposition Algorithms for Support Vector Machines
Hush, D. R., & Scovel, C. (2003) · Machine Learning · doi:10.1023/a:1021877911972 · Cited by 78
Maximum-Gain Working Set Selection for SVMs
Glasmachers, T., & Igel, C. (2006) · Journal of Machine Learning Research · doi:10.5555/1248547.1248600 · Cited by 77
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
Hush, D. R., Kelly, P. J., Scovel, C., & Steinwart, I. (2006) · doi:10.5555/1248547.1248573 · Cited by 73
Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds
Steinwart, I. (2003) · Cited by 70
On the convergence of a modified version of SVMlightalgorithm
Palagi, L., & Sciandrone, M. (2005) · Optimization methods & software · doi:10.1080/10556780512331318209 · Cited by 39
Comments on the "Core Vector Machines: Fast SVM Training on Very Large Data Sets"
Loosli, G., & Canu, S. (2007) · doi:10.5555/1248659.1248670 · Cited by 37
Very Large SVM Training using Core Vector Machines.
Tsang, I. W.-H., Kwok, J. T.-Y., & Cheung, P.-M. (2005) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · Cited by 29
A General Convergence Theorem for the Decomposition Method
List, N., & Simon, H. U. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-27819-1_25 · Cited by 28
Collobert, R. (2004) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Cited by 26
Cited by
Multiple instance learning: A survey of problem characteristics and applications
Carbonneau, M.-A., Cheplygina, V., Granger, E., & Gagnon, G. (2018) · Pattern Recognition · doi:10.1016/j.patcog.2017.10.009 · Cited by 740
“For example, the computational complexity of 1915 an SVM is between O(n2) and O(n3) when using traditional QP and LP solvers [180], where n is the number of instances.”
MethodEfficient Additive Kernels via Explicit Feature Maps
Vedaldi, A., & Zisserman, A. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.153 · Cited by 688
Problem formulations and solvers in linear SVM: a review
Chauhan, V. K., Dahiya, K., & Sharma, A. (2019) · Artificial Intelligence Review · doi:10.1007/s10462-018-9614-6 · Cited by 660
Hyperparameter Search in Machine Learning
Claesen, M., & Moor, B. D. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.02127 · Cited by 333
How Complex Is Your Classification Problem?: A Survey on Measuring Classification Complexity
Lorena, A. C., Garcia, L. P. F., Lehmann, J., Souto, M. C. P., & Ho, T. K. (2020) · ACM Computing Surveys · doi:10.1145/3347711 · Cited by 275
Metadata
- Authors
- Bottou, L., & Lin, C.-J.
- Venue
- Large-Scale Kernel Machines
- Publisher
- The MIT Press
- Published
- 2007-08-17
- Pages
- 1-28
- OpenAlex
- W2546945975
- Cited by
- 336
- References
- 43
- FWCI
- 12.03
- Type
- book chapter
- 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.