The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Structural risk minimization over data-dependent hierarchies
Abstract
The paper introduces some generalizations of Vapnik's (1982) method of structural risk minimization (SRM). As well as making explicit some of the details on SRM, it provides a result that allows one to trade off errors on the training sample against improved generalization performance. It then considers the more general case when the hierarchy of classes is chosen in response to the data. A result is presented on the generalization performance of classifiers with a "large margin". This theoretically explains the impressive generalization performance of the maximal margin hyperplane algorithm of Vapnik and co-workers (which is the basis for their support vector machines). The paper concludes with a more general result in terms of "luckiness" functions, which provides a quite general way for exploiting serendipitous simplicity in observed data to obtain better prediction accuracy from small training sets. Four examples are given of such functions, including the Vapnik-Chervonenkis (1971) dimension measured on the sample.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
System Identification: Theory for the User
Lennart Ljung, A. (1987) · Cited by 17,690
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
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
Weak Convergence and Empirical Processes
van der Vaart, A. W., & Wellner, J. A. (1996) · Springer Series in Statistics · doi:10.1007/978-1-4757-2545-2 · Cited by 5,014
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
Vapnik, V. N., & Chervonenkis, A. Y. (2015) · Measures of Complexity · doi:10.1007/978-3-319-21852-6_3 · Cited by 3,105
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
Cited by
A Tutorial on Support Vector Machines for Pattern Recognition
Burges, C. J. C. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009715923555 · Cited by 16,429
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
Self-citationAn overview of statistical learning theory
Vapnik, V. N. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.788640 · Cited by 6,266
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
Self-citation(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
(1999) · doi:10.1162/089976600300015565 · Cited by 2,799
Boosting the margin: a new explanation for the effectiveness of voting methods
Bartlett, P., Freund, Y., Lee, W. S., & Schapire, R. E. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691352 · Cited by 2,306
Self-citationRademacher and Gaussian Complexities: Risk Bounds and Structural Results
Bartlett, P. L., & Mendelson, S. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44581-1_15 · Cited by 1,949
Self-citationAdvances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
Regularization Networks and Support Vector Machines
Evgeniou, T., Pontil, M., & Poggio, T. (2000) · Advances in Computational Mathematics · doi:10.1023/a:1018946025316 · Cited by 1,197
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
Convexity, Classification, and Risk Bounds
Bartlett, P. L., Jordan, M. I., & McAuliffe, J. D. (2006) · Journal of the American Statistical Association · doi:10.1198/016214505000000907 · Cited by 1,037
Self-citationCristianini, N., Kandola, J., Elisseeff, A., & Shawe-Taylor, J. (2006) · Studies in Fuzziness and Soft Computing · doi:10.1007/3-540-33486-6_8 · Cited by 837
Self-citationBounds on Error Expectation for Support Vector Machines
Vapnik, V., & Chapelle, O. (2000) · Neural Computation · doi:10.1162/089976600300015042 · Cited by 624
The Role of Occam's Razor in Knowledge Discovery
Domingos, P. (1999) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009868929893 · Cited by 459
Support vector learning for ordinal regression
Herbrich, R. (1999) · 9th International Conference on Artificial Neural Networks: ICANN '99 · doi:10.1049/cp:19991091 · Cited by 448
An Introduction to Boosting and Leveraging
Meir, R., & Rätsch, G. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_4 · Cited by 447
Theory of Classification: a Survey of Some Recent Advances
Boucheron, S., Bousquet, O., & Lugosi, G. (2005) · ESAIM: Probability and Statistics · doi:10.1051/ps:2005018 · Cited by 436
On the Generalization Ability of On-Line Learning Algorithms
Cesa-Bianchi, N., Conconi, A., & Gentile, C. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.833339 · Cited by 426
Margin based feature selection - theory and algorithms
Gilad-Bachrach, R., Navot, A., & Tishby, N. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015352 · Cited by 414
Linear Programming Boosting via Column Generation
Demiriz, A., Bennett, K. P., & Shawe-Taylor, J. (2002) · Machine Learning · doi:10.1023/a:1012470815092 · Cited by 413
Self-citationWhy Does Deep and Cheap Learning Work So Well?
Lin, H. W., Tegmark, M., & Rolnick, D. (2017) · Journal of Statistical Physics · doi:10.1007/s10955-017-1836-5 · Cited by 393
Rademacher penalties and structural risk minimization
Koltchinskii, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930926 · Cited by 373
Vincent, P., & Bengio, Y. (2002) · Machine Learning · doi:10.1023/a:1013955821559 · Cited by 317
Blum, A., Hopcroft, J., & Kannan, R. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108755528 · Cited by 304
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Self-citationTraining algorithms for fuzzy support vector machines with noisy data
Lin, C.-F., & Wang, S.-D. (2004) · Pattern Recognition Letters · doi:10.1016/j.patrec.2004.06.009 · Cited by 271
Zhou, S.-M., & Gan, J. Q. (2008) · Fuzzy Sets and Systems · doi:10.1016/j.fss.2008.05.016 · Cited by 269
Kernel methods: a survey of current techniques
Campbell, C. (2002) · Neurocomputing · doi:10.1016/s0925-2312(01)00643-9 · Cited by 268
A review of optimization methodologies in support vector machines
Shawe-Taylor, J., & Sun, S. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.06.026 · Cited by 256
Self-citationQuantum computing and supervised machine learning
Oneto, L., Ridella, S., & Anguita, D. (2017) · Quantum Inspired Computational Intelligence · doi:10.1016/b978-0-12-804409-4.00002-4 · Cited by 11
Metadata
- Authors
- Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1998
- Volume
- 44
- Issue
- 5
- Pages
- 1926-1940
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2106491486
- Cited by
- 527
- References
- 49
- FWCI
- 28.88
- 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.