The DOI matches its Crossref record; 215 of the 215 references it cites were found in a registry or an index.
Theory of Classification: a Survey of Some Recent Advances
Open accessAbstract
The last few years have witnessed important new developments in the theory and practice of pattern classification. We intend to survey some of the main new ideas that have led to these recent results.
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
A new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1993) · doi:10.1007/978-1-4899-4541-9 · Cited by 21,230
Classification and Regression Trees.
Ryzin, J. V., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1986) · Journal of the American Statistical Association · doi:10.2307/2288003 · Cited by 20,825
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1504 · Cited by 20,466
(2012) · Encyclopedia of the Sciences of Learning · doi:10.1007/978-1-4419-1428-6_5195 · Cited by 19,370
Bootstrap methods: another look at the jackknife
Efron, B. (1979) · The Annals of Statistics · doi:10.1214/aos/1176344552 · Cited by 17,602
An Introduction to Support Vector Machines and Other Kernel-based Learning Methods
Cristianini, N., & Shawe-Taylor, J. (2000) · doi:10.1017/cbo9780511801389 · Cited by 13,855
(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
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Schölkopf, B., & Smola, A. J. (2001) · The MIT Press eBooks · doi:10.7551/mitpress/4175.001.0001 · Cited by 11,703
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Ideal spatial adaptation by wavelet shrinkage
Donoho, D. L., & Johnstone, I. M. (1994) · Biometrika · doi:10.1093/biomet/81.3.425 · Cited by 8,760
The Jackknife, the Bootstrap and Other Resampling Plans
Efron, B. (1982) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970319 · Cited by 8,120
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
Probability Inequalities for sums of Bounded Random Variables
Hoeffding, W. (1994) · Springer Series in Statistics · doi:10.1007/978-1-4612-0865-5_26 · Cited by 6,666
Pattern Recognition and Neural Networks
Ripley, B. D. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511812651 · Cited by 6,459
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
(1967) · Project Euclid (Cornell University) · Cited by 4,720
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Craven, P., & Wahba, G. (1978) · Numerische Mathematik · doi:10.1007/bf01404567 · Cited by 3,388
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
Self-citationOn 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
An Introduction to the Bootstrap.
Buckland, S. T., Efron, B., & Tibshirani, R. J. (1994) · Biometrics · doi:10.2307/2532810 · Cited by 3,103
Devijver, P. A., & Kittler, J. (1982) · Prentice-Hall International eBooks · Cited by 2,910
The Jackknife: The Bootstrap and Other Resampling Plans.
Low, L. Y., & Efron, B. (1983) · Journal of the American Statistical Association · doi:10.2307/2288218 · Cited by 2,702
Discriminant Analysis and Statistical Pattern Recognition.
Hawkins, D. M., & McLachlan, G. J. (1993) · Journal of the American Statistical Association · doi:10.2307/2290355 · Cited by 2,633
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
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
Convergence of Stochastic Processes.
Robinson, P. M., & Pollard, D. (1985) · Economica · doi:10.2307/2553898 · Cited by 2,184
Mallows, C. L. (1995) · Technometrics · doi:10.1080/00401706.1995.10484370 · Cited by 2,083
Cover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Mallows, C. L. (1973) · Technometrics · doi:10.2307/1267380 · Cited by 1,975
Rademacher 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
Advances in Large-Margin Classifiers
(2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.001.0001 · Cited by 1,869
Convergence of Stochastic Processes
Pollard, D. (1984) · Springer Series in Statistics · doi:10.1007/978-1-4612-5254-2 · Cited by 1,841
Learnability and the Vapnik-Chervonenkis dimension
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989) · Journal of the ACM · doi:10.1145/76359.76371 · Cited by 1,839
An Introduction to Computational Learning Theory
Kearns, M. J., & Vazirani, U. (1994) · doi:10.7551/mitpress/3897.001.0001 · Cited by 1,697
Boosting a Weak Learning Algorithm by Majority
Freund, Y. (1995) · Information and Computation · doi:10.1006/inco.1995.1136 · Cited by 1,674
A Universal Prior for Integers and Estimation by Minimum Description Length
Rissanen, J. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346150 · Cited by 1,672
On the mathematical foundations of learning
Cucker, F., & Smale, S. (2001) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-01-00923-5 · Cited by 1,545
Theoretical Foundations of the Potential Function Method in Pattern Recognition Learning
Айзерман, М. А. (1964) · Automation and Remote Control · Cited by 1,485
On the method of bounded differences
McDiarmid, C. (1989) · Surveys in Combinatorics, 1989 · doi:10.1017/cbo9781107359949.008 · Cited by 1,425
Neural network learning theoretical foundations
Anthony, M., & Bartlett, P. L. (2009) · Cited by 1,310
Discriminant Analysis and Statistical Pattern Recognition
McLachlan, G. J. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/0471725293 · Cited by 1,267
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
Probability Inequalities for Sums of Bounded Random Variables
Hoeffding, W. (1963) · Journal of the American Statistical Association · doi:10.2307/2282952 · Cited by 1,166
Ledoux, M., & Talagrand, M. (1991) · doi:10.1007/978-3-642-20212-4 · Cited by 1,160
Pattern recognition using generalized portrait method
Vapnik, V. N. (1963) · Automation and Remote Control · Cited by 1,151
Arcing classifier (with discussion and a rejoinder by the author)
Breiman, L. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691079 · Cited by 1,105
Weighted sums of certain dependent random variables
Azuma, K. (1967) · Tohoku Mathematical Journal · doi:10.2748/tmj/1178243286 · Cited by 1,084
Mallows, C. L. (1995) · Technometrics · doi:10.2307/1269729 · Cited by 1,080
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
A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
Kimeldorf, G. S., & Wahba, G. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697089 · Cited by 939
Boosting With the L2Loss: Regression and Classification
Bühlmann, P., & Yu, B. (2003) · Journal of the American Statistical Association · doi:10.1198/016214503000125 · Cited by 845
On the density of families of sets
Sauer, N. (1972) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(72)90019-2 · Cited by 844
Decision theoretic generalizations of the PAC model for neural net and other learning applications
Haussler, D. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90010-d · Cited by 843
Concentration of measure and isoperimetric inequalities in product spaces
Talagrand, M. (1995) · Publications Mathématiques de l'IHÉS · doi:10.1007/bf02699376 · Cited by 829
Uniform Central Limit Theorems
Dudley, R. M. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511665622 · Cited by 785
Probability Inequalities for the Sum of Independent Random Variables
Bennett, G. (1962) · Journal of the American Statistical Association · doi:10.1080/01621459.1962.10482149 · Cited by 782
Asymptotic Theory of Finite Dimensional Normed Spaces
(1986) · Lecture Notes in Mathematics · doi:10.1007/bfb0075912 · Cited by 778
Statistical behavior and consistency of classification methods based on convex risk minimization
Zhang, T. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120130 · Cited by 711
Logistic Regression, AdaBoost and Bregman Distances
Collins, M., Schapire, R. E., & Singer, Y. (2002) · Machine Learning · doi:10.1023/a:1013912006537 · Cited by 687
Risk bounds for model selection via penalization
Barron, A., Birgé, L., & Massart, P. (1999) · Probability Theory and Related Fields · doi:10.1007/s004400050210 · Cited by 657
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244302760200704 · Cited by 636
The connection between regularization operators and support vector kernels
Smola, A. J., Schölkopf, B., & Müller, K.-R. (1998) · Neural Networks · doi:10.1016/s0893-6080(98)00032-x · Cited by 625
Neural Network Learning: Theoretical Foundations
Anthony, M., & Bartlett, P. L. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624216 · Cited by 598
Optimal aggregation of classifiers in statistical learning
Tsybakov, A. B. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120131 · Cited by 582
Specht, D. F. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80210 · Cited by 576
Central Limit Theorems for Empirical Measures
Dudley, R. M. (1978) · The Annals of Probability · doi:10.1214/aop/1176995384 · Cited by 571
Bartlett, P. L., Bousquet, O., & Mendelson, S. (2002) · Cited by 533
Self-citationEmpirical Processes in M-Estimation
van de Geer, S. (2000) · Cited by 530
Structural risk minimization over data-dependent hierarchies
Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705570 · Cited by 527
New concentration inequalities in product spaces
Talagrand, M. (1996) · Inventiones Mathematicae · doi:10.1007/s002220050108 · Cited by 501
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
On a Problem of Adaptive Estimation in Gaussian White Noise
Lepski, O. (1991) · Theory of Probability and Its Applications · doi:10.1137/1135065 · Cited by 495
A combinatorial problem; stability and order for models and theories in infinitary languages
Shelah, S. (1972) · Pacific Journal of Mathematics · doi:10.2140/pjm.1972.41.247 · Cited by 491
ε-Entropy and ε-Capacity of Sets In Functional Spaces
Tikhomirov, V. M. (1993) · Mathematics and Its Applications · doi:10.1007/978-94-017-2973-4_7 · Cited by 488
Sharper Bounds for Gaussian and Empirical Processes
Talagrand, M. (1994) · The Annals of Probability · doi:10.1214/aop/1176988847 · Cited by 480
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303765208377 · Cited by 467
McAllester, D. A. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279989 · Cited by 464
Empirical Margin Distributions and Bounding the Generalization Error of Combined Classifiers
Koltchinskii, V., & Panchenko, D. (2002) · The Annals of Statistics · doi:10.1214/aos/1015362183 · Cited by 451
Some Limit Theorems for Empirical Processes
Gine, E., & Zinn, J. (1984) · The Annals of Probability · doi:10.1214/aop/1176993138 · Cited by 432
Algorithmic Stability and Sanity-Check Bounds for Leave-One-Out Cross-Validation
Kearns, M., & Ron, D. (1999) · Neural Computation · doi:10.1162/089976699300016304 · Cited by 407
McDiarmid, C. (1998) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12788-9_6 · Cited by 405
A general lower bound on the number of examples needed for learning
Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90002-3 · Cited by 403
A course on empirical processes
Dudley, R. M. (1984) · Lecture Notes in Mathematics · doi:10.1007/bfb0099432 · Cited by 384
Smooth discrimination analysis
Mammen, E., & Tsybakov, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939240 · Cited by 377
Rademacher penalties and structural risk minimization
Koltchinskii, V. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930926 · Cited by 373
Bartlett, P. L., Bousquet, O., & Mendelson, S. (2005) · The Annals of Statistics · doi:10.1214/009053605000000282 · Cited by 372
Self-citationLocal Rademacher complexities and oracle inequalities in risk minimization
Koltchinskii, V. I. (2006) · The Annals of Statistics · doi:10.1214/009053606000001019 · Cited by 364
中澤, 真. (1997) · Medical Entomology and Zoology · Cited by 354
McAllester, D. A. (1999) · Proceedings of the twelfth annual conference on Computational learning theory · doi:10.1145/307400.307435 · Cited by 354
From Model Selection to Adaptive Estimation
Birgé, L., & Massart, P. (1997) · Festschrift for Lucien Le Cam · doi:10.1007/978-1-4612-1880-7_4 · Cited by 344
Scale-sensitive dimensions, uniform convergence, and learnability
Alon, N., Ben-David, S., Cesa-Bianchi, N., & Haussler, D. (1997) · Journal of the ACM · doi:10.1145/263867.263927 · Cited by 340
Probabilistic Methods for Algorithmic Discrete Mathematics
Habib, M., McDiarmid, C., Alfonsín, J. L. R., & Reed, B. A. (1998) · Algorithms and combinatorics · doi:10.1007/978-3-662-12788-9 · Cited by 338
A Theory of Learning and Generalization
Vidyasagar, M. (1997) · Cited by 337
Isoperimetry and Gaussian analysis
Ledoux, M. (1996) · Lecture Notes in Mathematics · doi:10.1007/bfb0095676 · Cited by 328
Minimum Contrast Estimators on Sieves: Exponential Bounds and Rates of Convergence
Birgé, L., Massart, P., & Birgé, L. (1998) · Bernoulli · doi:10.2307/3318720 · Cited by 326
Talagrand, M. (1996) · The Annals of Probability · doi:10.1214/aop/1042644705 · Cited by 325
Model Selection and Error Estimation
Bartlett, P. L., Boucheron, S., & Lugosi, G. (2002) · Machine Learning · doi:10.1023/a:1013999503812 · Cited by 297
Self-citationSphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimension
Haussler, D. (1995) · Journal of Combinatorial Theory, Series A · doi:10.1016/0097-3165(95)90052-7 · Cited by 288
About the constants in Talagrand's concentration inequalities for empirical processes
Massart, P. (2000) · The Annals of Probability · doi:10.1214/aop/1019160263 · Cited by 280
Functional Gradient Techniques for Combining Hypotheses
Mason, L., Baxter, J., Bartlett, P. L., & Frean, M. (2000) · Advances in Large-Margin Classifiers · doi:10.7551/mitpress/1113.003.0017 · Cited by 279
General conditions for predictivity in learning theory
Poggio, T., Rifkin, R., Mukherjee, S., & Niyogi, P. (2004) · Nature · doi:10.1038/nature02341 · Cited by 276
Lepski, O. V., Mammen, E., & Spokoiny, V. G. (1997) · The Annals of Statistics · doi:10.1214/aos/1069362731 · Cited by 274
A Bennett concentration inequality and its application to suprema of empirical processes
Bousquet, O. (2002) · Comptes Rendus. Mathématique · doi:10.1016/s1631-073x(02)02292-6 · Cited by 262
Self-citationBounding $\bar{d}$-distance by informational divergence: a method to prove measure concentration
Marton, K. (1996) · The Annals of Probability · doi:10.1214/aop/1039639365 · Cited by 261
On Talagrand's deviation inequalities for product measures
Ledoux, M. (1997) · ESAIM: Probability and Statistics · doi:10.1051/ps:1997103 · Cited by 255
Asymptotically Minimax Adaptive Estimation. I: Upper Bounds. Optimally Adaptive Estimates
Lepski, O. (1992) · Theory of Probability and Its Applications · doi:10.1137/1136085 · Cited by 255
Machine Learning: A Theoretical Approach
NATARAJAN, B. K. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 253
Risk bounds for statistical learning
Massart, P., & Nédélec, É. (2006) · The Annals of Statistics · doi:10.1214/009053606000000786 · Cited by 253
Measuring Mass Concentrations and Estimating Density Contour Clusters-An Excess Mass Approach
Polonik, W. (1995) · The Annals of Statistics · doi:10.1214/aos/1176324626 · Cited by 248
Large Sample Optimality of Least Squares Cross-Validation in Density Estimation
Hall, P. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346329 · Cited by 240
Some applications of concentration inequalities to statistics
Massart, P. (2000) · Annales de la Faculté des sciences de Toulouse : Mathématiques · doi:10.5802/afst.961 · Cited by 240
Capacity of reproducing kernel spaces in learning theory
Zhou, D. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813564 · Cited by 238
Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations
Vapnik, V. N., & Chervonenkis, A. Y. (1982) · Theory of Probability and Its Applications · doi:10.1137/1126059 · Cited by 236
Concentration inequalities using the entropy method
Boucheron, S., Lugosi, G., & Massart, P. (2003) · The Annals of Probability · doi:10.1214/aop/1055425791 · Cited by 235
Self-citationPAC-Bayesian Generalisation Error Bounds for Gaussian Process Classification
Seeger, M. (2003) · Journal of Machine Learning Research · doi:10.1162/153244303765208386 · Cited by 229
Support Vector Machines and the Bayes Rule in Classification
Lin, Y. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1015469627679 · Cited by 226
Distribution-free performance bounds for potential function rules
Devroye, L., & Wagner, T. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056087 · Cited by 226
Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
Steinwart, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839514 · Cited by 225
(2000) · An Introduction to Support Vector Machines and Other Kernel-based Learning Methods · doi:10.1017/cbo9780511801389.008 · Cited by 212
Rates of convergence for minimum contrast estimators
Birgé, L., & Massart, P. (1993) · Probability Theory and Related Fields · doi:10.1007/bf01199316 · Cited by 211
Rademacher Processes and Bounding the Risk of Function Learning
Koltchinskii, V., & Panchenko, D. (2000) · High Dimensional Probability II · doi:10.1007/978-1-4612-1358-1_29 · Cited by 209
On nonparametric estimation of density level sets
Tsybakov, A. B. (1997) · The Annals of Statistics · doi:10.1214/aos/1069362732 · Cited by 209
A measure concentration inequality for contracting markov chains
Marton, K. (1996) · Geometric and Functional Analysis · doi:10.1007/bf02249263 · Cited by 202
PAC-Bayesian Stochastic Model Selection
McAllester, D. A. (2003) · Machine Learning · doi:10.1023/a:1021840411064 · Cited by 190
(2005) · Springer Monographs in Mathematics · doi:10.1007/3-540-27499-5 · Cited by 187
On the Bayes-risk consistency of regularized boosting methods
Lugosi, G., & Vayatis, N. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120129 · Cited by 185
Self-citationA sharp concentration inequality with applications
Boucheron, S., Lugosi, G., & Massart, P. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(200005)16:3<277::aid-rsa4>3.0.co;2-1 · Cited by 185
Self-citationA note on margin-based loss functions in classification
Lin, Y. (2004) · Statistics & Probability Letters · doi:10.1016/j.spl.2004.03.002 · Cited by 181
Bartlett, P. L., & Mendelson, S. (2006) · Probability Theory and Related Fields · doi:10.1007/s00440-005-0462-3 · Cited by 176
A simple proof of the blowing-up lemma (Corresp.)
Marton, K. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057176 · Cited by 172
Improved Bounds on the Sample Complexity of Learning
Li, Y., Long, P. M., & Srinivasan, A. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1741 · Cited by 171
Statistical performance of support vector machines
Blanchard, G., Bousquet, O., & Massart, P. (2008) · The Annals of Statistics · doi:10.1214/009053607000000839 · Cited by 167
Self-citationAn experimental and theoretical comparison of model selection methods
Kearns, M., Mansour, Y., Ng, A. Y., & Ron, D. (1995) · Proceedings of the eighth annual conference on Computational learning theory - COLT '95 · doi:10.1145/225298.225301 · Cited by 167
Support Vector Machines are Universally Consistent
Steinwart, I. (2002) · Journal of Complexity · doi:10.1006/jcom.2002.0642 · Cited by 164
Moment inequalities for functions of independent random variables
Boucheron, S., Bousquet, O., Lugosi, G., & Massart, P. (2005) · The Annals of Probability · doi:10.1214/009117904000000856 · Cited by 163
Self-citationA Few Notes on Statistical Learning Theory
Mendelson, S. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36434-x_1 · Cited by 161
Learning pattern classification-a survey
Kulkarni, S. R., Lugosi, G., & Venkatesh, S. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720536 · Cited by 161
Self-citationComplexity Regularization with Application to Artificial Neural Networks
Barron, A. R. (1991) · Nonparametric Functional Estimation and Related Topics · doi:10.1007/978-94-011-3222-0_42 · Cited by 160
Bounds on conditional probabilities with applications in multi-user communication
Ahlswede, R., G�cs, P., & K�rner, J. (1976) · Probability Theory and Related Fields · doi:10.1007/bf00535682 · Cited by 154
The densest hemisphere problem
Johnson, D. S., & Preparata, F. P. (1978) · Theoretical Computer Science · doi:10.1016/0304-3975(78)90006-3 · Cited by 152
Automatic pattern recognition: a study of the probability of error
Devroye, L. (1988) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.3915 · Cited by 144
Some special vapnik-chervonenkis classes
Wenocur, R. S., & Dudley, R. M. (1981) · Discrete Mathematics · doi:10.1016/0012-365x(81)90274-0 · Cited by 143
Universal Donsker Classes and Metric Entropy
Dudley, R. M. (2010) · Springer eBooks · doi:10.1007/978-1-4419-5821-1_19 · Cited by 141
Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks
Karpiński, M., & Macintyre, A. J. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1477 · Cited by 138
A Finite Sample Distribution-Free Performance Bound for Local Discrimination Rules
Rogers, W. H., & Wagner, T. J. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344196 · Cited by 135
Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers
Goldberg, P. W., & Jerrum, M. (1993) · Conference on Learning Theory · doi:10.1145/168304.168377 · Cited by 133
Moment Inequalities for Functions of Independent Random Variables
Boucheron, S., Bousquet, O., Lugosi, G., & Massart, P. (2005) · Cited by 133
Self-citationProcess consistency for AdaBoost
Jiang, W. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120128 · Cited by 130
Distribution-free inequalities for the deleted and holdout error estimates
Devroye, L., & Wagner, T. J. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056032 · Cited by 128
An alternative point of view on Lepski's method
Birgé, L. (2001) · Lecture notes-monograph series · doi:10.1214/lnms/1215090065 · Cited by 127
Hoffmann-Jørgensen, J. (1977) · Lecture notes in mathematics · doi:10.1007/bfb0097492 · Cited by 125
Model selection in nonparametric regression
Wegkamp, M. H. (2003) · The Annals of Statistics · doi:10.1214/aos/1046294464 · Cited by 123
Regularization Networks and Support Vector Machines
Evgeniou, T., Pontil, M., & Poggio, T. (2000) · The MIT Press eBooks · doi:10.7551/mitpress/1113.003.0014 · Cited by 123
Bostwick, A. E. (1896) · Science · doi:10.1126/science.3.54.66-a · Cited by 117
Assouad, P. (1983) · Annales de l’institut Fourier · doi:10.5802/aif.938 · Cited by 108
Model selection for regression on a fixed design
Baraud, Y. (2000) · Probability Theory and Related Fields · doi:10.1007/pl00008731 · Cited by 107
Entropy and the combinatorial dimension
Mendelson, S., & Vershynin, R. (2003) · Inventiones mathematicae · doi:10.1007/s00222-002-0266-3 · Cited by 105
On prediction of individual sequences
Cesa‐Bianchi, N., & Lugosi, G. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939242 · Cited by 105
Self-citationUniversal Donsker Classes and Metric Entropy
Dudley, R. M. (1987) · The Annals of Probability · doi:10.1214/aop/1176991978 · Cited by 102
Uniform and universal Glivenko-Cantelli classes
Dudley, R. M., Gin�, E., & Zinn, J. (1991) · Journal of Theoretical Probability · doi:10.1007/bf01210321 · Cited by 100
On the rate of convergence of regularized boosting classifiers
Blanchard, G., Lugosi, G., & Vayatis, N. (2003) · doi:10.5555/945365.964298 · Cited by 100
Self-citationThe importance of convexity in learning with squared loss
Lee, W. S., Bartlett, P. L., & Williamson, R. C. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.705577 · Cited by 98
Information inequalities and concentration of measure
Dembo, A. (1997) · The Annals of Probability · doi:10.1214/aop/1024404424 · Cited by 91
Neural Networks with Quadratic VC Dimension
Koiran, P., & Sontag, E. D. (1997) · Journal of Computer and System Sciences · doi:10.1006/jcss.1997.1479 · Cited by 91
Minimax nonparametric classification .I. Rates of convergence
Yang, Y. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796368 · Cited by 91
Pattern Classification and Learning Theory
Lugosi, G. (2002) · Springer eBooks · doi:10.1007/978-3-7091-2568-7_1 · Cited by 89
Self-citationLimitations of Learning via Embeddings in Euclidean Half-Spaces
Ben-David, S., Eiron, N., & Simon, H. U. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44581-1_25 · Cited by 89
Fast Rates for Support Vector Machines
Steinwart, I., & Scovel, C. (2005) · Lecture notes in computer science · doi:10.1007/11503415_19 · Cited by 88
Population theory for boosting ensembles
Breiman, L. (2004) · The Annals of Statistics · doi:10.1214/aos/1079120126 · Cited by 88
Localized Rademacher Complexities
Bartlett, P. L., Bousquet, O., & Mendelson, S. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45435-7_4 · Cited by 87
Self-citationConcentration Inequalities for Sub-Additive Functions Using the Entropy Method
Bousquet, O. (2003) · Birkhäuser Basel eBooks · doi:10.1007/978-3-0348-8069-5_14 · Cited by 85
Self-citationPredicting (0, 1)-functions on randomly drawn points
Haussler, D. H., Littlestone, N., & Warmuth, M. K. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21928 · Cited by 79
Lower bounds for Bayes error estimation
Antos, A., Devroye, L., & Györfi, L. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.777375 · Cited by 76
Finiteness results for sigmoidal “neural” networks
Macintyre, A. J., & Sontag, E. D. (1993) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/167088.167192 · Cited by 70
Complexity Regularization via Localized Random PenaltiesPreprint
Lugosi, G., & Wegkamp, M. H. (2002) · Cited by 66
Self-citationConcept learning using complexity regularization
Lugosi, G., & Zeger, K. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481777 · Cited by 64
Self-citationAdaptive model selection using empirical complexities
Lugosi, G., & Nobel, A. B. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939241 · Cited by 62
Self-citationLower bounds in pattern recognition and learning
Devroye, L., & Lugosi, G. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00141-8 · Cited by 57
Self-citationSquare root penalty: Adaptation to the margin in classification and in edge estimation
Tsybakov, A. B., & van de Geer, S. (2005) · The Annals of Statistics · doi:10.1214/009053604000001066 · Cited by 57
Balls in Rk do not cut all subsets of k + 2 points
Dudley, R. M. (1979) · Advances in Mathematics · doi:10.1016/0001-8708(79)90047-1 · Cited by 55
Complexity regularization via localized random penalties
Lugosi, G., & Wegkamp, M. (2004) · The Annals of Statistics · doi:10.1214/009053604000000463 · Cited by 55
Self-citationConcentration for Independent Permutations
McDiarmid, C. (2002) · Combinatorics Probability Computing · doi:10.1017/s0963548301005089 · Cited by 54
Vapnik-Chervonenkis dimension of neural nets
Bartlett, P. L., & Maass, W. (2003) · Cited by 54
General bounds on the number of examples needed for learning probabilistic concepts
Simon, H. U. (1993) · Annual Conference on Computational Learning Theory (COLT) · doi:10.1145/168304.168385 · Cited by 50
A result of Vapnik with applications
Anthony, M., & Shawe-Taylor, J. (1993) · Discrete Applied Mathematics · doi:10.1016/0166-218x(93)90126-9 · Cited by 48
Self bounding learning algorithms
Freund, Y. (1998) · doi:10.1145/279943.279993 · Cited by 48
The Glivenko-Cantelli problem, ten years later
Talagrand, M. (1996) · Journal of Theoretical Probability · doi:10.1007/bf02214655 · Cited by 47
On the optimal parameter choice for v-support vector machines
Steinwart, I. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1233901 · Cited by 44
Generalization bounds for averaged classifiers
Freund, Y., Mansour, Y., & Schapire, R. E. (2004) · The Annals of Statistics · doi:10.1214/009053604000000058 · Cited by 43
Cited by
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
(2012) · MPG.PuRe (Max Planck Society) · doi:10.5555/2188385.2188410 · Cited by 3,603
A survey of cross-validation procedures for model selection
Arlot, S., & Celisse, A. (2010) · Statistics Surveys · doi:10.1214/09-ss054 · Cited by 3,522
(2015) · Cited by 2,857
A Kernel Method for the Two-Sample-Problem
Gretton, A., Borgwardt, K. M., Rasch, M., Schölkopf, B., & Smola, A. J. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0069 · Cited by 2,167
Metadata
- Authors
- Boucheron, S., Bousquet, O., & Lugosi, G.
- Venue
- ESAIM: Probability and Statistics
- Publisher
- EDP Sciences
- Published
- 2005-11
- Volume
- 9
- Pages
- 323-375
- ISSN
- 1262-3318 (ISSN-L)
- 1292-8100
- OpenAlex
- W2014902932
- Cited by
- 436
- References
- 215
- FWCI
- 27.14
- Type
- journal article
- Language
- en
- Open access
- bronze
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.