The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
A survey of decision tree classifier methodology
Open accessAbstract
A survey is presented of current methods for decision tree classifier (DTC) designs and the various existing issues. After considering potential advantages of DTCs over single-state classifiers, the subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed. The relation between decision trees and neutral networks (NN) is also discussed.>
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
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
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
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
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
An introduction to computing with neural nets
Lippmann, R. (1987) · IEEE ASSP Magazine · doi:10.1109/massp.1987.1165576 · Cited by 7,825
A Rapidly Convergent Descent Method for Minimization
Fletcher, R., & Powell, M. J. D. (1963) · The Computer Journal · doi:10.1093/comjnl/6.2.163 · Cited by 4,583
On the mean accuracy of statistical pattern recognizers
Hughes, G. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054102 · Cited by 2,859
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Branch-and-Bound Methods: A Survey
Lawler, E. L., & Wood, D. E. (1966) · Operations Research · doi:10.1287/opre.14.4.699 · Cited by 1,997
Problem-Solving Methods in Artificial Intelligence
Nilsson, N. J. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,607
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
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
On Measures of Information and their Characterizations
(1975) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6157-0 · Cited by 811
The art of computer programming. Vol.1: Fundamental algorithms
Knuth, D. E. (1978) · Virtual Defense Library (Ministerio de Defensa) · Cited by 801
Incremental Induction of Decision Trees
Utgoff, P. E. (1989) · Machine Learning · doi:10.1023/a:1022699900025 · Cited by 791
A Branch and Bound Algorithm for Computing k-Nearest Neighbors
Fukunaga, K., & Narendra, P. M. (1975) · IEEE Transactions on Computers · doi:10.1109/t-c.1975.224297 · Cited by 736
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
Decision trees and decision-making
Quinlan, J. R. (1990) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.52545 · Cited by 566
The decision tree classifier: Design and potential
Swain, P. H., & Hauska, H. (1977) · IEEE Transactions on Geoscience Electronics · doi:10.1109/tge.1977.6498972 · Cited by 552
Golomb, S. W., & Baumert, L. D. (1965) · Journal of the ACM · doi:10.1145/321296.321300 · Cited by 498
Introduction to statistical pattern recognition
Davis, J. C. (1996) · Computers & Geosciences · doi:10.1016/0098-3004(96)00017-9 · Cited by 463
Knuth, D. E. (1971) · Acta Informatica · doi:10.1007/bf00264289 · Cited by 443
Sequential Methods in Pattern Recognition and Machine Learning
(1968) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6002-3 · Cited by 424
Optimal pruning with applications to tree-structured source coding and modeling
Chou, P. A., Lookabaugh, T., & Gray, R. M. (1989) · IEEE Transactions on Information Theory · doi:10.1109/18.32124 · Cited by 407
A Recursive Partitioning Decision Rule for Nonparametric Classification
Friedman (1977) · IEEE Transactions on Computers · doi:10.1109/tc.1977.1674849 · Cited by 368
Maximum-Entropy and Bayesian Methods in Inverse Problems
(1985) · Springer eBooks · doi:10.1007/978-94-017-2221-6 · Cited by 338
Entropy nets: from decision trees to neural networks
Sethi, I. K. (1990) · Proceedings of the IEEE · doi:10.1109/5.58346 · Cited by 285
Watanabé, S. (1969) · Cited by 244
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
Hierarchical Classifier Design Using Mutual Information
Sethi, I. K., & Sarvarayudu, G. P. R. (1982) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1982.4767278 · Cited by 184
Fuzzy Decision Tree Algorithms
Chang, R. L.-P., & Pavlidis, T. (1977) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1977.4309586 · Cited by 167
A Nonparametric Partitioning Procedure for Pattern Classification
Henrichon, E. G., & Fu, K. (1969) · IEEE Transactions on Computers · doi:10.1109/t-c.1969.222728 · Cited by 120
A performance comparison of trained multilayer perceptrons and trained classification trees
Atlas, L., Cole, R. A., Muthusamy, Y. K., Lippman, A., Connor, J. T., Park, D., El-Sharkawai, M., & Marks, R. J. (1990) · Proceedings of the IEEE · doi:10.1109/5.58347 · Cited by 113
Application of information theory to the construction of efficient decision trees
Hartmann, C. R. P., Varshney, P. K., Mehrotra, K., & Gerberich, C. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056522 · Cited by 105
Pattern recognition as a quest for minimum entropy
Watanabé, S. (1981) · Pattern Recognition · doi:10.1016/0031-3203(81)90094-7 · Cited by 103
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
Problem-Solving Models and Search Strategies for Pattern Recognition
Kanal, L. N. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766905 · Cited by 76
Decision tree design from a communication theory standpoint
Goodman, R. M., & Smyth, P. (1988) · IEEE Transactions on Information Theory · doi:10.1109/18.21221 · Cited by 68
Information-Theoretical Aspects of Inductive and Deductive Inference
Watanabé, S. (1960) · IBM Journal of Research and Development · doi:10.1147/rd.42.0208 · Cited by 66
A Growth Algorithm for Neural Network Decision Trees
Golea, M., & Marchand, M. (1990) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/12/3/003 · Cited by 55
Hall, P. A. V. (1971) · International Joint Conference on Artificial Intelligence · Cited by 24
Pattern recognition by human and machine
Ashby, F. G. (1992) · Journal of Mathematical Psychology · doi:10.1016/0022-2496(92)90056-d · Cited by 3
Cited by
On hyperparameter optimization of machine learning algorithms: Theory and practice
Yang, L., & Shami, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.07.061 · Cited by 3,232
Explainable AI: a review of machine learning interpretability methods
Linardatos, P., Papastefanopoulos, V., & Kotsiantis, S. (2020) · Entropy · doi:10.3390/e23010018 · Cited by 2,922
An assessment of support vector machines for land cover classification
Huang, C., Davis, L. S., & Townshend, J. R. G. (2002) · International Journal of Remote Sensing · doi:10.1080/01431160110040323 · Cited by 1,795
Decision trees: a recent overview
Kotsiantis, S. B. (2013) · Artificial Intelligence Review · doi:10.1007/s10462-011-9272-4 · Cited by 1,568
Decision tree classification of land cover from remotely sensed data
Friedl, M. A., & Brodley, C. E. (1997) · Remote Sensing of Environment · doi:10.1016/s0034-4257(97)00049-7 · Cited by 1,542
Metadata
- Authors
- Safavian, S. R., & Landgrebe, D.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics
- Published
- 1991
- Volume
- 21
- Issue
- 3
- Pages
- 660-674
- ISSN
- 0018-9472 (ISSN-L)
- OpenAlex
- W2125283600
- Cited by
- 3,808
- References
- 45
- FWCI
- 32.10
- Type
- journal article
- Language
- en
- Open access
- green
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.