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
Items 201–215 of 215
Kieffer, J. C. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256497 · Cited by 42
Combinatorics of random processes and sections of convex bodies
Rudelson, M., & Vershynin, R. (2006) · Annals of Mathematics · doi:10.4007/annals.2006.164.603 · Cited by 41
The Consistency of Greedy Algorithms for Classification
Mannor, S., Meir, R., & Zhang, T. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45435-7_22 · Cited by 40
Symmetrization approach to concentration inequalities for empirical processes
Panchenko, D. (2003) · The Annals of Probability · doi:10.1214/aop/1068646378 · Cited by 37
Herbrich, R., & Williamson, R. C. (2002) · ANU Open Research (Australian National University) · doi:10.1162/153244303765208368 · Cited by 29
Density estimation via exponential model selection
Castellan, G. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.814485 · Cited by 28
Existence of submatrices with all possible columns
Steele, J. M. (1978) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(78)90046-8 · Cited by 27
Some Extensions of an Inequality of Vapnik and Chervonenkis
Panchenko, D. (2002) · Electronic Communications in Probability · doi:10.1214/ecp.v7-1047 · Cited by 26
Kushner, H. J., & Clark, D. S. (1978) · Applied mathematical sciences · doi:10.1007/978-1-4684-9352-8_7 · Cited by 24
Hardness results for neural network approximation problems
Bartlett, P. L., & Ben-David, S. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00057-3 · Cited by 23
Minimax nonparametric classification. II. Model selection for adaptation
Yang, Y. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796369 · Cited by 23
On the infeasibility of training neural networks with small mean-squared error
Vu, V. H. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.737520 · Cited by 20
Concentration for locally acting permutations
Luczak, M., & McDiarmid, C. (2003) · Discrete Mathematics · doi:10.1016/s0012-365x(02)00628-3 · Cited by 18
On the rate of convergence of regularized boosting classifiers
Blanchard, G., Lugosi, G., & Vayatis, N. (2003) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · doi:10.1162/1532443041424319 · Cited by 18
Self-citationA Note on Talagrand's Concentration Inequality
Panchenko, D. (2001) · Electronic Communications in Probability · doi:10.1214/ecp.v6-1034 · Cited by 16
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.