The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Supervised Learning
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
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
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842
Kernel Methods for Pattern Analysis
Shawe-Taylor, J., & Cristianini, N. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511809682 · Cited by 6,587
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. J. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 4,568
Hansen, L. K., & Salamon, P. (1990) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.58871 · Cited by 4,260
An Introduction to Support Vector Machines
Cristianini, N., & Shawe-Taylor, J. S. (2000) · ePrints Soton (University of Southampton) · Cited by 4,115
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
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
Toward a Universal Law of Generalization for Psychological Science
Shepard, R. N. (1987) · Science · doi:10.1126/science.3629243 · Cited by 2,416
Measures of Diversity in Classifier Ensembles and Their Relationship with the Ensemble Accuracy
Kuncheva, L. I., & Whitaker, C. J. (2003) · Machine Learning · doi:10.1023/a:1022859003006 · Cited by 2,335
Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
Wilson, D. L. (1972) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1972.4309137 · Cited by 2,130
IEEE Transactions on Information Theory
(2023) · IEEE Transactions on Information Theory · doi:10.1109/tit.18 · Cited by 1,856
Neural Network Ensembles, Cross Validation, and Active Learning
Krogh, A., & Vedelsby, J. (1994) · Cited by 1,838
The condensed nearest neighbor rule (Corresp.)
Hart, P. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054155 · Cited by 1,733
The Lack of A Priori Distinctions Between Learning Algorithms
Wolpert, D. H. (1996) · Neural Computation · doi:10.1162/neco.1996.8.7.1341 · Cited by 1,647
Li, M., Chen, X., Li, X., Ma, B., & Vitanyi, P. M. B. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.838101 · Cited by 1,062
Cover trees for nearest neighbor
Beygelzimer, A., Kakade, S., & Langford, J. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143857 · Cited by 813
Bias plus variance decomposition for zero-one loss functions
Kohavi, R., & Wolpert, D. H. (1996) · Cited by 652
Improving Regressors using Boosting Techniques
Drucker, H. (1997) · International Conference on Machine Learning · Cited by 650
Towards parameter-free data mining
Keogh, E., Lonardi, S., & Ratanamahatana, C. A. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014077 · Cited by 567
The reduced nearest neighbor rule (Corresp.)
Gates, G. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054809 · Cited by 566
Advances in Instance Selection for Instance-Based Learning Algorithms
Brighton, H., & Mellish, C. (2002) · Data Mining and Knowledge Discovery · doi:10.1023/a:1014043630878 · Cited by 532
An algorithm for a selective nearest neighbor decision rule (Corresp.)
Ritter, G., Woodruff, H., Lowry, S., & Isenhour, T. (1975) · IEEE Transactions on Information Theory · doi:10.1109/tit.1975.1055464 · Cited by 323
Diversity versus Quality in Classification Ensembles Based on Feature Selection
Cunningham, P., & Carney, J. G. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45164-1_12 · Cited by 219
Self-citationActive learning: theory and applications
Koller, D., & Tong, S. (2001) · Cited by 210
Nearest neighbors in random subspaces
Ho, T. K. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0033288 · Cited by 203
Addressing the Selective Superiority Problem: Automatic Algorithm/Model Class Selection
Brodley, C. E. (1993) · Elsevier eBooks · doi:10.1016/b978-1-55860-307-3.50009-5 · Cited by 151
Boosted Mixture of Experts: An Ensemble Learning Scheme
Avnimelech, R., & Intrator, N. (1999) · Neural Computation · doi:10.1162/089976699300016737 · Cited by 103
An Analysis of Case-Base Editing in a Spam Filtering System
Delany, S. J., & Cunningham, P. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28631-8_11 · Cited by 79
Self-citationHamann, H. (2018) · Springer eBooks · doi:10.1007/978-3-032-10584-4_8 · Cited by 11
Any time induction of decision trees: an iterative improvement approach
Esmeir, S., & Markovitch, S. (2006) · Cited by 9
(1998)
Cited by
Efficient Acceleration of Deep Learning Inference on Resource-Constrained Edge Devices: A Review
Shuvo, M. M. H., Islam, S. K., Cheng, J., & Morshed, B. I. (2023) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3226481 · Cited by 436
A Review of Machine Learning and Deep Learning Approaches on Mental Health Diagnosis
Iyortsuun, N. K., Kim, S.-H., Jhon, M., Yang, H.-J., & Pant, S. (2023) · Healthcare · doi:10.3390/healthcare11030285 · Cited by 276
A Comprehensive Survey on Poisoning Attacks and Countermeasures in Machine Learning
Tian, Z., Cui, L., Liang, J., & Yu, S. (2023) · ACM Computing Surveys · doi:10.1145/3551636 · Cited by 271
Generative Artificial Intelligence in Education: Advancing Adaptive and Personalized Learning
Guettala, M., Bourekkache, S., Kazar, O., & Harous, S. (2024) · Acta Informatica Pragensia · doi:10.18267/j.aip.235 · Cited by 218
Oloyede, M., Akpakwu, G., Myburgh, H., De Freitas, A., & Kunatsa, T. (2024) · World Electric Vehicle Journal · doi:10.3390/wevj15090381 · Cited by 47
Metadata
- Authors
- Cunningham, P., Cord, M., & Delany, S. J.
- Venue
- Cognitive Technologies
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008-02-06
- Pages
- 21-49
- OpenAlex
- W4205475721
- Cited by
- 387
- References
- 36
- FWCI
- 0.00
- Type
- book chapter
- 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.