The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Top-Down Induction of Decision Trees Classifiers—A Survey
Abstract
Decision trees are considered to be one of the most popular approaches for representing classifiers. Researchers from various disciplines such as statistics, machine learning, pattern recognition, and data mining considered the issue of growing a decision tree from available data. This paper presents an updated survey of current methods for constructing decision tree classifiers in a top-down manner. The paper suggests a unified algorithmic framework for presenting these algorithms and describes the various splitting criteria and pruning methodologies.
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
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Multivariate Adaptive Regression Splines
Friedman, J. H. (1991) · The Annals of Statistics · doi:10.1214/aos/1176347963 · Cited by 8,000
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
Pattern Classification and Scene Analysis.
Clarke, M. R. B., Duda, R. O., & Hart, P. E. (1974) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2344977 · Cited by 3,222
An exploratory technique for investigating large quantities of categorical data
Kass, G. V. (1980) · Applied Statistics · doi:10.2307/2986296 · Cited by 2,880
Quinlan, J. R. (1987) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(87)80053-6 · Cited by 2,553
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
Lim, T.-S., Loh, W.-Y., & Shih, Y.-S. (2000) · Machine Learning · doi:10.1023/a:1007608224229 · Cited by 1,133
Quinlan (2003) · Cited by 1,000
Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
Murthy, S. K. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009744630224 · Cited by 991
Constructing optimal binary decision trees is NP-complete
Hyafil, L., & Rivest, R. L. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90095-8 · Cited by 959
SPLIT SELECTION METHODS FOR CLASSIFICATION TREES
Loh, W., & Shih, Y. (1997) · Cited by 944
Incremental Induction of Decision Trees
Utgoff, P. E. (1989) · Machine Learning · doi:10.1023/a:1022699900025 · Cited by 791
SPRINT: A Scalable Parallel Classifier for Data Mining
Shafer, J. C., Agrawal, R., & Mehta, M. (1996) · Cited by 787
Applications of Information Theory to Psychology
Garner, W. R. (1959) · The Journal of Nervous and Mental Disease · doi:10.1097/00005053-195911000-00013 · Cited by 755
SLIQ: A fast scalable classifier for data mining
Mehta, M., Agrawal, R., & Rissanen, J. (1996) · Lecture Notes in Computer Science · doi:10.1007/bfb0014141 · Cited by 749
A System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. L. (1994) · Cited by 723
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
A System for Induction of Oblique Decision Trees
Murthy, S. K., Kasif, S., & Salzberg, S. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.63 · Cited by 590
Decision trees and decision-making
Quinlan, J. R. (1990) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.52545 · Cited by 566
A comparative analysis of methods for pruning decision trees
Esposito, F., Malerba, D., Semeraro, G., & Kay, J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.589207 · Cited by 549
Learning Boolean concepts in the presence of many irrelevant features
Almuallim, H., & Dietterich, T. G. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90084-1 · Cited by 520
Brodley, C. E., & Utgoff, P. E. (1995) · Machine Learning · doi:10.1023/a:1022607123649 · Cited by 451
A Distance-Based Attribute Selection Measure for Decision Tree Induction
De Mántaras, R. L. (1991) · Machine Learning · doi:10.1023/a:1022694001379 · Cited by 417
Boolean Feature Discovery in Empirical Learning
Pagallo, G., & Haussler, D. (1990) · Machine Learning · doi:10.1023/a:1022611825350 · Cited by 390
A Recursive Partitioning Decision Rule for Nonparametric Classification
Friedman (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674849 · Cited by 368
Decision Tree Induction Based on Efficient Tree Restructuring
Utgoff, P. E., Berkman, N. C., & Clouse, J. A. (1997) · Machine Learning · doi:10.1023/a:1007413323501 · Cited by 359
RainForest—A Framework for Fast Decision Tree Construction of Large Datasets
Gehrke, J., Ramakrishnan, R., & Ganti, V. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009839829793 · Cited by 348
Tree-Structured Classification via Generalized Discriminant Analysis
Loh, W.-Y., & Vanichsetakul, N. (1988) · Journal of the American Statistical Association · doi:10.1080/01621459.1988.10478652 · Cited by 320
UNKNOWN ATTRIBUTE VALUES IN INDUCTION
Quinlan, J. R. (1989) · Elsevier eBooks · doi:10.1016/b978-1-55860-036-2.50048-5 · Cited by 302
BOAT—optimistic decision tree construction
Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W.-Y. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304197 · Cited by 288
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
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Rastogi, R., & Shim, K. (2000) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009887311454 · Cited by 216
Mining Very Large Databases with Parallel Processing
Freitas, A. A., & Lavington, S. H. (2000) · Springer eBooks · doi:10.1007/978-1-4615-5521-6 · Cited by 211
Wallace, C. S., & Patrick, J. D. (1993) · Machine Learning · doi:10.1023/a:1022646101185 · Cited by 200
MDL-based decision tree pruning
Mehta, M., Rissanen, J., & Agrawal, R. (1995) · Cited by 187
Perceptron Trees: A Case Study in Hybrid Concept Representations
UTGOFF, P. E. (1989) · Connection Science · doi:10.1080/09540098908915648 · Cited by 179
Learning decision rules in noisy domains
Niblett, T., & Ivan Bratko, A. (1987) · 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 the Accuracy of Meta-learning for Scalable Data Mining
Chan, P. K., & Stolfo, S. J. (1997) · Journal of Intelligent Information Systems · doi:10.1023/a:1008640732416 · Cited by 158
Thaid a Sequential Analysis Program for the Analysis of Nominal Scale Dependent Variables
Morgan, J. N., & Messenger, R. C. (1973) · Deep Blue (University of Michigan) · Cited by 155
BOAT—optimistic decision tree construction
Gehrke, J. E., Ganti, V., Ramakrishnan, R., & Loh, W. (1999) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/304182.304197 · Cited by 149
CLOUDS: a decision tree classifier for large datasets
Alsabti, K. A., Ranka, S., & Singh, V. K. (1998) · Cited by 148
Extensions to the CART algorithm
Crawford, S. L. (1989) · International Journal of Man-Machine Studies · doi:10.1016/0020-7373(89)90027-8 · Cited by 139
Decision trees and multi-valued attributes
Quilan, J. R. (1988) · Machine intelligence · Cited by 122
A combined nonparametric approach to feature selection and binary decision tree design
Rounds, E. M. (1980) · Pattern Recognition · doi:10.1016/0031-3203(80)90029-1 · Cited by 101
Lower Bounds on Learning Decision Lists and Trees
Hancock, T. R., Jiang, T., Li, M., & Tromp, J. (1996) · Information and Computation · doi:10.1006/inco.1996.0040 · Cited by 101
Families of splitting criteria for classification trees
Shih, Y. (1999) · Statistics and Computing · doi:10.1023/a:1008920224518 · Cited by 100
Oblivious Decision Trees and Abstract Cases
Langley, P., & Sage, S. (1994) · Cited by 87
A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization
Kearns, M. J., & Mansour, Y. (1998) · Cited by 76
An Exact Probability Metric for Decision Tree Splitting and Stopping
Martin, J. K. (1997) · Machine Learning · doi:10.1023/a:1007367629006 · Cited by 72
IMPROVING STABILITY OF DECISION TREES
Last, M., Maimon, O., & Minkov, E. (2002) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001402001599 · Cited by 65
Self-citationFINDING SMALL EQUIVALENT DECISION TREES IS HARD
Zantema, H., & Bodlaender, H. L. (2000) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054100000193 · Cited by 60
Targeting business users with decision table classifiers
Kohavi, R., & Sommerfield, D. A. (1998) · Cited by 54
Myopic Policies in Sequential Classification
Ben‐Bassat (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675054 · Cited by 41
Extensions to the CART algorithm
Crawford, S. L. (1990) · Academic Press Ltd. eBooks · Cited by 41
Cited by
Rokach, L. (2010) · Artificial Intelligence Review · doi:10.1007/s10462-009-9124-7 · Cited by 2,657
Self-citationClassification 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
CatBoost: unbiased boosting with categorical features
Prokhorenkova, L., Gusev, G., Vorobev, A., Dorogush, A. V., & Gulin, A. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.09516 · Cited by 1,110
González, S., García, S., Del Ser, J., Rokach, L., & Herrera, F. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.07.007 · Cited by 582
Self-citationThe preeminence of ethnic diversity in scientific collaboration
AlShebli, B. K., Rahwan, T., & Woon, W. L. (2018) · Nature Communications · doi:10.1038/s41467-018-07634-8 · Cited by 490
Metadata
- Authors
- Rokach, L., & Maimon, O.
- Venue
- IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews)
- Published
- 2005-11
- Volume
- 35
- Issue
- 4
- Pages
- 476-487
- ISSN
- 1094-6977 (ISSN-L)
- OpenAlex
- W2148239836
- Cited by
- 792
- References
- 63
- FWCI
- 24.18
- 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.