The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
A Comparison of Decision Tree Ensemble Creation Techniques
Abstract
We experimentally evaluate bagging and seven other randomization-based approaches to creating an ensemble of decision tree classifiers. Statistical tests were performed on experimental results from 57 publicly available data sets. When cross-validation comparisons were tested for statistical significance, the best method was statistically more accurate than bagging on only eight of the 57 data sets. Alternatively, examining the average ranks of the algorithms across the group of data sets, we find that boosting, random forests, and randomized trees are statistically significantly better than bagging. Because our results suggest that using an appropriate ensemble size is important, we introduce an algorithm that decides when a sufficient number of classifiers has been created for an ensemble. Our algorithm uses the out-of-bag error estimate, and is shown to result in an accurate ensemble for those methods that incorporate bagging into the construction of the ensemble.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
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
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
Dietterich, T. G. (2000) · Machine Learning · doi:10.1023/a:1007607513941 · Cited by 2,941
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Bauer, E., & Kohavi, R. (1999) · Machine Learning · doi:10.1023/a:1007515423169 · Cited by 2,638
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
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
Combined 5 × 2 cv F Test for Comparing Supervised Classification Learning Algorithms
Alpaydm, E. (1999) · Neural Computation · doi:10.1162/089976699300016007 · Cited by 431
A New Ensemble Diversity Measure Applied to Thinning Ensembles
Banfield, R. E., Hall, L., Bowyer, K. W., & Kegelmeyer, W. P. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44938-8_31 · Cited by 86
Self-citationComparing pure parallel ensemble creation techniques against bagging
Hall, L., Bowyer, K. W., Banfield, R. E., Bhadoria, D., Kegelmeyer, W. P., & Eschrich, S. A. (2004) · Proceedings · doi:10.1109/icdm.2003.1250970 · Cited by 26
Self-citation
Cited by
Sagi, O., & Rokach, L. (2018) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1249 · Cited by 3,103
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Decision trees: a recent overview
Kotsiantis, S. B. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9272-4 · Cited by 1,568
Gong, P., Liu, H., Zhang, M., Li, C., Wang, J., Huang, H., Clinton, N., Ji, L., Li, W., Bai, Y., et al. (2019) · Science Bulletin · doi:10.1016/j.scib.2019.03.002 · Cited by 1,285
Lu, C., Wang, Z.-Y., Qin, W.-L., & Ma, J. (2017) · Signal Processing · doi:10.1016/j.sigpro.2016.07.028 · Cited by 775
Metadata
- Authors
- Banfield, R. E., Hall, L. O., Bowyer, K. W., & Kegelmeyer, W. P.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2007-01
- Volume
- 29
- Issue
- 1
- Pages
- 173-180
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2117085409
- Cited by
- 383
- References
- 12
- FWCI
- 11.86
- 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.