The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
An overview of statistical learning theory
Abstract
Statistical learning theory was introduced in the late 1960's. Until the 1990's it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990's new types of learning algorithms (called support vector machines) based on the developed theory were proposed. This made statistical learning theory not only a tool for the theoretical analysis but also a tool for creating practical algorithms for estimating multidimensional functions. This article presents a very general overview of statistical learning theory including both theoretical and algorithmic aspects of the theory. The goal of this overview is to demonstrate how the abstract learning theory established conditions for generalization which are more general than those discussed in classical statistical paradigms and how the understanding of these conditions inspired new algorithmic approaches to function estimation problems. A more detailed overview of the theory (without proofs) can be found in Vapnik (1995). In Vapnik (1998) one can find detailed description of the theory (including proofs).
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.
Integrity signals
Registry
Cites
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.
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
Self-citationThe Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Self-citationSpline Models for Observational Data
Wahba, G. (1990) · doi:10.1137/1.9781611970128 · Cited by 4,184
A Probabilistic Theory of Pattern Recognition
Devroye, L., Györfi, L., & Lugosi, G. (1996) · Stochastic Modelling and Applied Probability · doi:10.1007/978-1-4612-0711-5 · Cited by 3,274
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (1971) · Theory of Probability & Its Applications · doi:10.1137/1116025 · Cited by 2,448
Self-citation
Research works printed but not linked: 25
- williamson, 1999, entropy number, operators, and support vector kernels, Advances in Kernel Methods— Support Vector Learning
- 10.1162/089976698300017269 · DOI · Paper page
- 10.1162/neco.1995.7.2.219 · DOI · Paper page
- 10.1007/978-3-642-82657-3_24 · DOI
- minsky, 1969, Perceptrons, 248
- opper, 1999, on the annealed vc entropy for margin classifiers: a statistical mechanics study, Advances in Kernel Methods— Support Vector Learning
- rumelhart, 1986, learning internal representations by error propagation, Parallel Distributed Processing Explorations in Macrostructure of Cognition, i, 318
- 10.1109/18.705570 · DOI · Paper page
- 10.1162/089976698300017467 · DOI · Paper page
- 10.1016/S0893-6080(98)00032-X · DOI · Paper page
- 10.1007/BF02214655 · DOI
- vidyasagar, 1997, A Theory of Learning and Generalization
- 10.1145/76359.76371 · DOI · Paper page
- vapnik, 1991, the necessary and sufficient conditions for consistency of the method of empirical risk minimization, Yearbook of the Academy of Sciences of the USSR on Recognition Classification and Forecasting, 2, 217
- bartlett, 1999, generalization performance on support vector machines and other pattern classifiers, Advances in Kernel Methods— Support Vector Learning
- burges, 1996, simplified support vector decision rule, Proc 13th Int Conf Machine Learning, 71
- 10.1145/130385.130401 · DOI · Paper page
- burges, 1999, geometry and invariance in kernel-based methods, Advances in Kernel Methods— Support Vector Learning
- 10.1006/jcss.1996.0033 · doi:10.1006/jcss.1996.0033
- 10.1145/263867.263927 · DOI · Paper page
- vapnik, 1979, Estimation of Dependencies Based on Empirical Data, 448
- vapnik, 1998, Statistical Learning Theory, 736
- vapnik, 1968, On the uniform convergence of relative frequencies of events to their probabilities, 181
- 10.1137/1126059 · DOI
- vapnik, 1979, <emph>theory of pattern recognition</emph>. moscow, russia: nauka, 1974 (in russian). german translation: w. n. wapnik and a. ja. chervonenkis, Theorie der Zeichenerkennung, 353
Cited by
Deo, R. C. (2015) · Circulation · doi:10.1161/circulationaha.115.001593 · Cited by 3,466
Human-level concept learning through probabilistic program induction
Lake, B. M., Salakhutdinov, R., & Tenenbaum, J. B. (2015) · Science · doi:10.1126/science.aab3050 · Cited by 2,817
A review of classification algorithms for EEG-based brain–computer interfaces
Lotte, F., Congedo, M., Lécuyer, A., Lamarche, F., & Arnaldi, B. (2007) · Journal of Neural Engineering · doi:10.1088/1741-2560/4/2/r01 · Cited by 2,665
Machinery health prognostics: A systematic review from data acquisition to RUL prediction
Lei, Y., Li, N., Guo, L., Li, N., Yan, T., & Lin, J. (2018) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2017.11.016 · Cited by 2,634
Deep Learning for Health Informatics
Ravì, D., Wong, C., Deligianni, F., Berthelot, M., Andreu-Perez, J., Lo, B., & Yang, G.-Z. (2017) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2016.2636665 · Cited by 2,000
Metadata
- Authors
- Vapnik, V. N.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1999
- Volume
- 10
- Issue
- 5
- Pages
- 988-999
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2149298154
- Cited by
- 6,266
- References
- 5
- FWCI
- 15.06
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An overview of statistical learning theory. https://app.cochat.ai/papers/10.1109/72.788640
- The paper
- Vapnik, V. N. (1999). An overview of statistical learning theory. IEEE Transactions on Neural Networks. https://doi.org/10.1109/72.788640
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.
