The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The Nature of Statistical Learning Theory
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“we applied a linear support vector machine (SVM; [69, 70]) pattern-recognition method to each dataset, with standard leave-one-out cross validation (LOOCV).”
From Assessing ADHD symptoms in children and adults: evaluating the role of objective measures (2018) · cites this paper as [69]
In the citing paper
“A formal version of this is called structural risk minimization [6], [7], and it is based on defining a sequence of learning machines of increasing capacity, corresponding to a sequence of subsets of the parameter space such that each subset is a superset of the previous subset.”
From Gradient-based learning applied to document recognition (1998) · cites this paper as [6]
In the citing paper
“The support vector technique is an extremely economical way of representing complex surfaces in high-dimensional spaces, including polynomials and many other types of surfaces [6].”
From Gradient-based learning applied to document recognition (1998) · cites this paper as [6]
In the citing paper
“Theoretical arguments [6], [7] suggest that estimating input densities when the real goal is to obtain a discriminant function for classification is a suboptimal strategy.”
From Gradient-based learning applied to document recognition (1998) · cites this paper as [6]
Citations
Cites
Methods of Solving Ill-Posed ProblemsPreprint
Srinivasamurthy, S. B. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.5323 · Cited by 330
Aggarwal, C. C. (2023) · Springer eBooks · doi:10.1007/978-3-031-29642-0_2 · Cited by 37
Cited by
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Self-citationModern Applied Statistics with S
Venables, W. N., & Ripley, B. D. (2002) · Statistics and Computing · doi:10.1007/978-0-387-21706-2 · Cited by 24,305
Metadata
- Authors
- Vapnik, V. N.
- Affiliations
- AT&T (United States) (US)
- Corresponding author
- Vapnik, Vladimir N.
- Venue
- Springer eBooks
- Publisher
- Springer New York
- Published
- 1995
- OpenAlex
- W2156909104
- Cited by
- 39,138
- References
- 2
- Citations by year
- 2026: 362 · 2025: 619 · 2024: 606 · 2023: 630 · 2022: 854 · 2021: 1555 · 2020: 1636 · 2019: 1656 · 2018: 1618 · 2017: 1660 · 2016: 1789 · 2015: 1984 · 2014: 2097 · 2013: 2115 · 2012: 2258
- FWCI
- 38.39
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Springer eBooks (publishedVersion)
- International Linear Collider (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
- Keywords
- statistical learning theory, support vector machine, function estimation, generalization, learning algorithms, VC dimension, empirical risk minimization
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: The Nature of Statistical Learning Theory. https://app.cochat.ai/papers/10.1007/978-1-4757-2440-0
- The paper
- Vapnik, V. N. (1995). The Nature of Statistical Learning Theory. Springer eBooks. https://doi.org/10.1007/978-1-4757-2440-0
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.