The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Open accessOverview
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
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1994) · doi:10.1201/9780429246593 · Cited by 40,500
(1992) · Cited by 23,431
An Introduction to the Bootstrap
Efron, B., & Tibshirani, R. J. (1993) · doi:10.1007/978-1-4899-4541-9 · Cited by 21,230
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
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection
Kohavi, R. (1995) · Zenodo · doi:10.5281/zenodo.19712698 · Cited by 10,909
Self-citationUCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
Wolpert, D. H. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80023-1 · Cited by 7,951
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms
Dietterich, T. G. (1998) · Neural Computation · doi:10.1162/089976698300017197 · Cited by 3,840
Neural Networks and the Bias/Variance Dilemma
Geman, S., Bienenstock, E., & Doursat, R. (1992) · Neural Computation · doi:10.1162/neco.1992.4.1.1 · Cited by 3,578 · cited 1×
“The bias plus variance decomposition (Geman, Bienenstock & Doursat 1992) is a powerful tool from sampling theory statistics for analyzing supervised learning scenarios that have quadratic loss functions.”
MethodOn the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Fayyad, U. M., & Irani, K. B. (1993) · International Joint Conference on Artificial Intelligence · Cited by 2,870
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
A desicion-theoretic generalization of on-line learning and an application to boosting
Freund, Y., & Schapire, R. E. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-59119-2_166 · Cited by 2,252
Bernardo, J. M., & Smith, A. F. M. (1994) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316870 · Cited by 2,178
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
Holte, R. C. (1993) · Machine Learning · doi:10.1023/a:1022631118932 · Cited by 1,791
Boosting a Weak Learning Algorithm by Majority
Freund, Y. (1995) · Information and Computation · doi:10.1006/inco.1995.1136 · Cited by 1,674
Quinlan, J. R. (1996) · National Conference on Artificial Intelligence · Cited by 1,586
An Introduction to the Bootstrap.
Kimber, A., Efron, B., & Tibshirani, R. J. (1994) · The Statistician · doi:10.2307/2348146 · Cited by 1,245
An analysis of Bayesian classifiers
Langley, P., Iba, W., & Thompson, K. (1992) · Cited by 1,214
On Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality
Friedman, J. H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009778005914 · Cited by 1,040
Pattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
Boosting the margin: A new explanation for the effectiveness of voting methods
Schapire, R. E., Freund, Y., Barlett, P., & Lee, W. S. (1997) · Cited by 711
Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier.
Domingos, P., & Pazzani, M. J. (1996) · Cited by 690
Bias plus variance decomposition for zero-one loss functions
Kohavi, R., & Wolpert, D. H. (1996) · Cited by 652
Self-citationThe Estimation of Probabilities: An Essay on Modern Bayesian Methods
Sparks, J. N., & Good, I. J. (1967) · American Educational Research Journal · doi:10.2307/1162122 · Cited by 528
Experiment with a new boosting algorithm
Freund, Y. (1996) · Medical Entomology and Zoology · Cited by 497
Estimating probabilities: a crucial task in machine learning
Cestnik, B. (1990) · European Conference on Artificial Intelligence · Cited by 459
Buntine, W. (1992) · Statistics and Computing · doi:10.1007/bf01889584 · Cited by 393
Error-Correcting Output Coding Corrects Bias and Variance
Kong, E. B., & Dietterich, T. G. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50046-3 · Cited by 365
Induction of One-Level Decision Trees
Iba, W., & Langley, P. (1992) · Machine Learning Proceedings 1992 · doi:10.1016/b978-1-55860-247-2.50035-8 · Cited by 349
Reducing Misclassification Costs
Pazzani, M., Merz, C., Murphy, P., Ali, K., Hume, T., & Brunk, C. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50034-9 · Cited by 340
The Estimation of Probabilities: An Essay on Modern Bayesian Methods
Hill, B. M., & Good, I. J. (1965) · Journal of the American Statistical Association · doi:10.2307/2283422 · Cited by 337
A Conservation Law for Generalization Performance
Schaffer, C. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50039-8 · Cited by 335
Data Mining Using $\mathcal{MLC}++$ a Machine Learning Library in C++
Kohavi, R., Sommerfield, D., & Dougherty, J. (1997) · International Journal of Artificial Intelligence Tools · doi:10.1142/s021821309700027x · Cited by 321
Self-citationData Mining Using MLC a Machine Learning Library in C
Kohavi, R., Sommerfield, D., & Dougherty, J. (1997) · Cited by 298
Self-citationError-based and entropy-based discretization of continuous features
Kohavi, R., & Sahami, M. (1996) · Cited by 267
Self-citationFeature subset selection using the wrapper method: overfltting and dynamic search space topology
Kohavi, R., & Sommerfield, D. (1995) · Knowledge Discovery and Data Mining · Cited by 260
Self-citationThe strength of weak learnability
Schapire, R. E. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63451 · Cited by 257
Wrappers for Performance Enhancements and Oblivious Decision Graphs.
Kohavi, R. (1995) · Cited by 248
Self-citationDrucker, H., & Cortes, C. (1995) · neural information processing systems · Cited by 229
Error-Correcting Output Codes: A General Method for Improving Multiclass Inductive Learning Programs
Dietterich, T. G. (2018) · The Mathematics of Generalization · doi:10.1201/9780429492525-14 · Cited by 207
Boosting a weak learning algorithm by majority
Freund, Y. (1990) · Colt Proceedings 1990 · doi:10.1016/b978-1-55860-146-8.50019-9 · Cited by 163
Kwok, S. W., & Carter, C. (1990) · Machine intelligence and pattern recognition · doi:10.1016/b978-0-444-88650-7.50030-5 · Cited by 148
Computational Learning Theory and Natural Learning Systems: Selecting Good Models
(1995) · The MIT Press eBooks · doi:10.7551/mitpress/2007.001.0001 · Cited by 136
The Effects of Training Set Size on Decision Tree Complexity
Oates, T., & Jensen, D. D. (1997) · Cited by 119
Comparing connectionist and symbolic learning methods
Quinlan, J. R. (1994) · Cited by 107
Option Decision Trees with Majority Votes
Kohavi, R., & Kunz, C. (1997) · Cited by 106
Self-citationLearning Symbolic Rules Using Artificial Neural Networks
Craven, M. W., & SHAVLIK, J. W. (1993) · Elsevier eBooks · doi:10.1016/b978-1-55860-307-3.50016-2 · Cited by 106
Why does bagging work? a Bayesian account and its implications
Domingos, P. (1997) · Cited by 89
Interpretable boosted naïve Bayes classification
Ridgeway, G. K., Madigan, D., Richardson, T. S., & O’Kane, J. W. (1998) · Cited by 77
Wolpert, D. H. (2018) · CRC Press eBooks · doi:10.1201/9780429492525-5 · Cited by 77
Kohavi, R., Becker, B., & Sommerfield, D. (1997) · Cited by 58
Self-citationOn Pruning and Averaging Decision Trees
Oliver, J., & Hand, D. J. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50060-8 · Cited by 58
(1996)
Cited by
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Geurts, P., Ernst, D., & Wehenkel, L. (2006) · Machine Learning · doi:10.1007/s10994-006-6226-1 · Cited by 9,300
Ensemble methods in machine learning
Dietterich, T. G. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45014-9_1 · Cited by 8,408
Friedman, J., Hastie, T., & Tibshirani, R. (2000) · The Annals of Statistics · doi:10.1214/aos/1016218223 · Cited by 6,884
A study of the behavior of several methods for balancing machine learning training data
Batista, G. E. A. P. A., Prati, R. C., & Monard, M. C. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007735 · Cited by 4,203
Metadata
- Authors
- Bauer, E., & Kohavi, R.
- Venue
- Machine Learning
- Published
- 1999-07
- Volume
- 36
- Issue
- 1-2
- Pages
- 105-139
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2152761983
- Cited by
- 2,638
- References
- 57
- FWCI
- 77.31
- 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.