The DOI matches its Crossref record; 162 of the 162 references it cites were found in a registry or an index.
Fifty Years of Classification and Regression Trees
Abstract
Fifty years have passed since the publication of the first regression tree algorithm. New techniques have added capabilities that far surpass those of the early methods. Modern classification trees can partition the data with linear splits on subsets of variables and fit nearest neighbor, kernel density, and other models in the partitions. Regression trees can fit almost every kind of traditional statistical model, including least‐squares, quantile, logistic, Poisson, and proportional hazards models, as well as models for longitudinal and multiresponse data. Greater availability and affordability of software (much of which is free) have played a significant role in helping the techniques gain acceptance and popularity in the broader scientific community. This article surveys the developments and briefly reviews the key ideas behind some of the major algorithms.
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
R: A Language and Environment for Statistical Computing
R Core Team (2025) · doi:10.32614/r.manuals · Cited by 352,181
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
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
Multiple Imputation for Nonresponse in Surveys
Rubin, D. B. (1987) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316696 · Cited by 20,701
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
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
Research works printed but not linked: 35
- 10.1002/bimj.4710360106 · doi:10.1002/bimj.4710360106
- 10.1080/03610929408831245 · DOI
- 10.1080/03610929608831696 · doi:10.1080/03610929608831696
- 10.1016/0167-9473(95)00023-2 · doi:10.1016/0167-9473(95)00023-2
- 10.2307/2533389 · DOI
- Alexander W. P., 1996, Treed regression, J. Comput. Graph. Stat., 5, 156, 10.1080/10618600.1996.10474702 · doi:10.1080/10618600.1996.10474702
- 10.1007/BF00985256 · doi:10.1007/bf00985256
- 10.1016/0167-8655(96)00033-5 · doi:10.1016/0167-8655(96)00033-5
- 10.1016/S0167-9473(01)00098-6 · doi:10.1016/s0167-9473(01)00098-6
- Chaudhuri P., 1995, Generalized regression trees, Stat. Sinica, 5, 641
- Chaudhuri P., 2002, Nonparametric estimation of conditional quantiles using quantile regression trees, Bernoulli, 8, 561
- 10.1109/TSMCA.2008.918598 · doi:10.1109/tsmca.2008.918598
- 10.1016/0167-9473(91)90103-9 · doi:10.1016/0167-9473(91)90103-9
- 10.1002/sim.1106 · doi:10.1002/sim.1106
- 10.1214/lnms/1215452213 · doi:10.1214/lnms/1215452213
- 10.1057/jors.1973.81 · doi:10.1057/jors.1973.81
- Gehrke J., 2009, Encyclopedia of Database Systems, 2469, 10.1007/978-0-387-39940-9_555 · doi:10.1007/978-0-387-39940-9_555
- Hoaglin D. C., 1995, A critical look at some analyses of major league baseball salaries, Am. Stat., 49, 277, 10.1080/00031305.1995.10476165 · doi:10.1080/00031305.1995.10476165
- 10.1016/j.csda.2004.06.019 · DOI
- 10.1177/0272989X04271048 · doi:10.1177/0272989x04271048
- Kooperberg C., 1997, Polychotomous regression, J. Amer. Statist. Assoc., 92, 117, 10.1080/01621459.1997.10473608 · doi:10.1080/01621459.1997.10473608
- 10.1016/0167-9473(91)90113-G · doi:10.1016/0167-9473(91)90113-g
- 10.1214/074921706000000464 · doi:10.1214/074921706000000464
- 10.1007/978-3-540-33037-0_18 · doi:10.1007/978-3-540-33037-0_18
- Loh W.‐Y., 2012, Probability approximations and beyond, 133
- Loh W.‐Y., 2007, Extrapolation errors in linear model trees, ACM Trans. On Knowledge Disc. From Data, 1
- 10.1109/T-C.1973.223603 · doi:10.1109/t-c.1973.223603
- 10.1109/TC.1977.1674938 · doi:10.1109/tc.1977.1674938
- Sela R. J., 2011, Reemtree: Regression trees with random effects
- 10.1016/0031-3203(77)90004-8 · doi:10.1016/0031-3203(77)90004-8
- Therneau T. M., 2011, rpart: Recursive partitioning
- 10.1109/72.963795 · doi:10.1109/72.963795
- 10.1142/S0218001405004125 · doi:10.1142/s0218001405004125
- 10.1007/11564096_45 · doi:10.1007/11564096_45
- 10.2307/1390825 · doi:10.2307/1390825
Cited by
Classification Based on Decision Tree Algorithm for Machine Learning
Charbuty, B., & Abdulazeez, A. (2021) · Journal of Applied Science and Technology Trends · doi:10.38094/jastt20165 · Cited by 1,871
A review on longitudinal data analysis with random forest
Hu, J., & Szymczak, S. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad002 · Cited by 678
Universal fragment descriptors for predicting properties of inorganic crystals
Isayev, O., Oses, C., Toher, C., Gossett, E., Curtarolo, S., & Tropsha, A. (2017) · Nature Communications · doi:10.1038/ncomms15679 · Cited by 651
Recent advances in decision trees: an updated survey
Costa, V. G., & Pedreira, C. E. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10275-5 · Cited by 572
Dropout vs. batch normalization: an empirical study of their impact to deep learning
Garbin, C., Zhu, X., & Marques, O. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-019-08453-9 · Cited by 571
Khan, A. A., Chaudhari, O., & Chandra, R. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2023.122778 · Cited by 530
Computational design optimization of concrete mixtures: A review
DeRousseau, M. A., Kasprzyk, J. R., & Srubar, W. V. (2018) · Cement and Concrete Research · doi:10.1016/j.cemconres.2018.04.007 · Cited by 359
Feature Importance in Gradient Boosting Trees with Cross-Validation Feature Selection
Adler, A. I., & Painsky, A. (2022) · Entropy · doi:10.3390/e24050687 · Cited by 149
Machine Learning in Human Olfactory Research
Lötsch, J., Kringel, D., & Hummel, T. (2019) · Chemical Senses · doi:10.1093/chemse/bjy067 · Cited by 71
Ryu, H., Kim, S., Kim, D., Han, S., Lee, K., & Kang, Y. (2020) · Proceedings of the ACM on Human-Computer Interaction · doi:10.1145/3415223 · Cited by 66
Warren Raffa, D., Bogdanski, A., & Tittonell, P. (2015) · Biomass and Bioenergy · doi:10.1016/j.biombioe.2015.07.022 · Cited by 66
Osman, I. H., Anouze, A. L., Irani, Z., Lee, H., Medeni, T. D., & Weerakkody, V. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2019.02.018 · Cited by 63
“Finally, for more details, we refer to the good book on statistical learning by Hastie et al. (2009) , and the review on CART development and applications by Loh (2014) .”
MethodKey drivers of green innovation in family firms: a machine learning approach
Veiga, P. M. (2025) · Journal of Family Business Management · doi:10.1108/jfbm-08-2024-0191 · Cited by 25
Metadata
- Authors
- Loh, W.
- Venue
- International Statistical Review
- Publisher
- Wiley
- Published
- 2014-06-30
- Volume
- 82
- Issue
- 3
- Pages
- 329-348
- ISSN
- 0306-7734 (ISSN-L)
- 1751-5823
- OpenAlex
- W1519043595
- Cited by
- 649
- References
- 162
- FWCI
- 49.93
- 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.