The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
A comparative analysis of methods for pruning decision trees
Abstract
In this paper, we address the problem of retrospectively pruning decision trees induced from data, according to a top-down approach. This problem has received considerable attention in the areas of pattern recognition and machine learning, and many distinct methods have been proposed in literature. We make a comparative study of six well-known pruning methods with the aim of understanding their theoretical foundations, their computational complexity, and the strengths and weaknesses of their formulation. Comments on the characteristics of each method are empirically supported. In particular, a wide experimentation performed on several data sets leads us to opposite conclusions on the predictive accuracy of simplified trees from some drawn in the literature. We attribute this divergence to differences in experimental designs. Finally, we prove and make use of a property of the reduced error pruning method to obtain an objective evaluation of the tendency to overprune/underprune observed in each method.
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
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
(1992) · Cited by 23,431
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
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
Classification and regression trees
Praagman, J. (1985) · European Journal of Operational Research · doi:10.1016/0377-2217(85)90321-2 · Cited by 10,053
A survey of decision tree classifier methodology
Safavian, S. R., & Landgrebe, D. (1991) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.97458 · Cited by 3,808
A leisurely look at the bootstrap, the jackknife, and cross-validation
Efron, B., & Gong, G. (1983) · The American Statistician · doi:10.1080/00031305.1983.10483087 · Cited by 3,229
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
Edgington, E., Edgington, E., & Onghena, P. (2007) · doi:10.1201/9781420011814 · Cited by 2,030
Edgington, E. S. (2004) · Encyclopedia of Statistical Sciences · doi:10.1002/0471667196.ess2169 · Cited by 2,028
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
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
Inferring decision trees using the minimum description lenght principle
Ross Quinlan, J., & Rivest, R. L. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90010-2 · Cited by 652
An Empirical Comparison of Pruning Methods for Decision Tree Induction
Mingers, J. (1989) · Machine Learning · doi:10.1023/a:1022604100933 · Cited by 627
An empirical comparison of selection measures for decision-tree induction
Mingers, J. (1989) · Machine Learning · doi:10.1007/bf00116837 · Cited by 561
ASSISTANT 86: a knowledge-elicitation tool for sophisticated users
Cestnik, B., Kononenko, I., & Bratko, I. (1987) · Medical Entomology and Zoology · Cited by 428
Concept learning and the problem of small disjuncts
Holte, R. C., Acker, L., & Porter, B. (1989) · Cited by 351
Schaffer, C. (1993) · Machine Learning · doi:10.1023/a:1022653209073 · Cited by 310
A further comparison of splitting rules for decision-tree induction
Buntine, W., & Niblett, T. (1992) · Machine Learning · doi:10.1007/bf00994006 · Cited by 269
An iterative growing and pruning algorithm for classification tree design
Gelfand, S. B., Ravishankar, C. S., & Delp, E. J. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.67645 · Cited by 224
The attribute selection problem in decision tree generation
Fayyad, U. M., & Irani, K. B. (1992) · National Conference on Artificial Intelligence · Cited by 218
Automatic Parameter Selection by Minimizing Estimated Error
Kohavi, R., & John, G. H. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50045-1 · Cited by 202
Learning decision rules in noisy domains
Niblett, T., & Ivan Bratko, A. (1987) · Cited by 175
Bias in information-based measures in decision tree induction
White, A. P., & Liu, W. Z. (1994) · Machine Learning · doi:10.1007/bf00993349 · Cited by 175
Trading accuracy for simplicity in decision trees
Bohanec, M., & Bratko, I. (1994) · Machine Learning · doi:10.1007/bf00993345 · Cited by 170
On estimating probabilities in tree pruning
Cestnik, B., & Ivan Bratko, A. (1991) · Lecture notes in computer science · doi:10.1007/bfb0017010 · Cited by 162
Expert Systems—Rule Induction with Statistical Data
Mingers, J. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.5 · Cited by 159
Constructing Decision Trees in Noisy Domains.
Niblett, T. (1987) · Cited by 127
A Further Comparison of Simplification Methods for Decision-Tree Induction
Malerba, D., Esposito, F., & Semeraro, G. M. (1996) · Lecture notes in statistics · doi:10.1007/978-1-4612-2404-4_35 · Cited by 43
Self-citationDecision tree pruning as a search in the state space
Esposito, F., Malerba, D., & Semeraro, G. M. (1993) · Lecture notes in computer science · doi:10.1007/3-540-56602-3_135 · Cited by 31
Self-citationSparse data and the effect of overfitting avoidance in decision tree induction
Schaffer, C. (1992) · Cited by 24
Deconstructing the Digit Recognition Problem
Schaffer, C. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50056-5 · Cited by 17
Cited by
Decision trees: a recent overview
Kotsiantis, S. B. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9272-4 · Cited by 1,568
An introduction to decision tree modeling
Myles, A. J., Feudale, R. N., Liu, Y., Woody, N. A., & Brown, S. D. (2004) · Journal of Chemometrics · doi:10.1002/cem.873 · Cited by 1,355
An assessment of the effectiveness of decision tree methods for land cover classification
Pal, M., & Mather, P. M. (2003) · Remote Sensing of Environment · doi:10.1016/s0034-4257(03)00132-9 · Cited by 1,142
A relative evaluation of multiclass image classification by support vector machines
Foody, G. M., & Mathur, A. (2004) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2004.827257 · Cited by 1,038
Prediction of Diabetes using Classification Algorithms
Sisodia, D., & Sisodia, D. S. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.05.122 · Cited by 900
Metadata
- Authors
- Esposito, F., Malerba, D., Semeraro, G., & Kay, J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1997-05
- Volume
- 19
- Issue
- 5
- Pages
- 476-493
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2111022379
- Cited by
- 549
- References
- 32
- FWCI
- 15.48
- 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.