Decision trees and decision-making
IEEE Transactions on Systems Man and CyberneticsPublished 1 January 1990
J. R. Quinlan
Citations560
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Various practical systems capable of extracting descriptive decision-making knowledge from data have been developed and evaluated and techniques that represent knowledge about classified tasks in the form of decision trees are examined.
Abstract
Various practical systems capable of extracting descriptive decision-making knowledge from data have been developed and evaluated. Techniques that represent knowledge about classified tasks in the form of decision trees are examined. A sample of techniques is sketched, ranging from basic methods of constructing decision trees to ways of using them noncategorically. Some characteristics that suggest whether a particular classification task is likely to be amenable or not to tree-based methods are discussed.>
Keywords
Computer Science
BiometricsClassification and Regression Trees.
23,841 Citations1984Alexander Gordon, Leo Breiman +3 more
Machine LearningInduction of Decision Trees
14,815 Citations1986J. R. Quinlan
This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, which is described in detail.
Machine LearningInduction of decision trees
12,383 Citations1986J. R. Quinlan
This paper summarizes an approach to synthesizing decision trees that has been used in a variety of systems, and it describes one such system, ID3, in detail, which is described in detail.
International Journal of Man-Machine StudiesSimplifying decision trees
2,502 Citations1987J. R. Quinlan
Techniques for simplifying decision trees while retaining their accuracy are discussed, described, illustrated, and compared on a test-bed of decision trees from a variety of domains.
Machine LearningThe CN2 Induction Algorithm
2,015 Citations1989Peter Clark, Tim Niblett
A description and empirical evaluation of a new induction system, CN2, designed for the efficient induction of simple, comprehensible production rules in domains where problems of poor description language and/or noise may be present.
DSpace@MIT (Massachusetts Institute of Technology)Learning Structural Descriptions From Examples
1,007 Citations1970Patrick Henry Winston
Machine LearningThe CN2 induction algorithm
994 Citations1989Peter Clark, Tim Niblett
A description and empirical evaluation of a new induction system, designed for the efficient induction of simple, comprehensible production rules in domains where problems of poor description language and/or noise may be present, is presented.
Information Processing LettersConstructing optimal binary decision trees is NP-complete
956 Citations1976Laurent Hyafil, Ronald L. Rivest
The proof to be given is relatively simple and the importance of this result can be measured in terms of the Jarge amount of effort that has been put into fmding efftient aJgorJthms for constructing optimal binary decision trees.
Behavioral and Brain SciencesOn artificial intelligence
885 Citations1985Peter H. Schönemann
This paper aims to boost the accuracy of a DP logistic regression (LR) via a pre-training module via a pre-training module and shows that adding a pre-training module significantly improves the accuracy of the DP-LR model.
Machine LearningIncremental Induction of Decision Trees
790 Citations1989Paul E. Utgoff
An incremental algorithm for inducing decision trees equivalent to those formed by Quinlan's nonincremental ID3 algorithm, given the same training instances is presented, named ID5R.
National Conference on Artificial IntelligenceThe multi-purpose incremental learning system AQ15 and its testing application to three medical domains
761 Citations1986Ryszard S. Michalski, Igor Mozetič +2 more
The demonstration that by applying the proposed method of cover truncation and analogical matching, called TRUNC, one may drastically decrease the complexity of the knowledge base without affecting its performance accuracy is demonstrated.
IBM Journal of Research and DevelopmentSome Studies in Machine Learning Using the Game of Checkers. II—Recent Progress
690 Citations1967Arthur L. Samuel
Information and ComputationInferring decision trees using the minimum description lenght principle
665 Citations1989J. R. Quinlan, Ronald L. Rivest
The use of Rissanen's minimum description length principle for the construction of decision trees is explored and empirical results comparing this approach to other methods are given.
An empirical comparison of pattern recognition, neural nets, and machine learning classification methods
470 Citations1989Sholom M. Weiss, Ioannis Kapouleas
For these problems, which have relatively few hypotheses and features, the machine learning procedures for rule induction or tree induction clearly performed best.
IEEE Transactions on Pattern Analysis and Machine IntelligencePattern Recognition as Rule-Guided Inductive Inference
405 Citations1980Ryszard S. Michalski
The paper formulates the theoretical framework and a method for inferring general and optimal descriptions of object classes from examples of classification or partial descriptions and an experimental computer implementation of the method is briefly described and illustrated by an example.
Machine LearningAn Overview of Machine Learning
386 Citations1983Jaime Carbonell, Ryszard S. Michalski +1 more
The study and computer modeling of learning processes in their multiple manifestations constitutes the subject matter of machine learning.
Machine LearningAn empirical comparison of selection measures for decision-tree induction
312 Citations1989John Mingers
The paper considers a number of different measures and experimentally examines their behavior in four domains and shows that the choice of measure affects the size of a tree but not its accuracy, which remains the same even when attributes are selected randomly.
Elsevier eBooksUNKNOWN ATTRIBUTE VALUES IN INDUCTION
303 Citations1989J. R. Quinlan
This paper compares the effectiveness of several approaches to the development and use of decision tree classifiers as measured by their performance on a collection of datasets.
National Conference on Artificial IntelligenceBeyond incremental processing: tracking concept drift
208 Citations1986Jeffrey C. Schlimmer, Richard Granger
This work presents a learning method that is able to learn complex Boolean characterizations while tolerating noise and drift and empirical results from an implementation are presented to show its ability to track changing concepts over time.
Elsevier eBooksDECISION TREES AS PROBABILISTIC CLASSIFIERS
187 Citations1987J. R. Quinlan
This paper outlines extensions to the way a case is classified by a decision tree that address shortcomings in the way cases are classified by the decision tree.
Machine LearningPROBABILISTIC DECISION TREES
157 Citations1990J. R. Quinlan
This chapter suggests methods of overcoming deficiencies through extensions to the way a case is classified by a decision tree.
Journal of the Operational Research SocietyExpert Systems—Rule Induction with Statistical Data
154 Citations1987John Mingers
Rule induction has been proposed as a way of speeding up the acquisition of knowledge for expert systems but can only deal with determinate data and extensions to deal with statistical data are explored.
Machine LearningA General Framework for Induction and a Study of Selective Induction
135 Citations1986Larry Rendell
This paper offers a synthetic view of induction which exploits uncertainty, task-guidance, and biases such as language restriction, and suggests a number of incipient principles for powerful induction.
International Journal of General SystemsON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
97 Citations1978Judea Pearl
This paper derives formal relationships between n, c and the probability of ambiguous predictions by examining three modeling languages under binary classification tasks: perceptrons, Boolean formulae, and Boolean networks.
Elsevier eBooksAn Empirical Comparison of Genetic and Decision-Tree Classifiers
95 Citations1988J. R. Quinlan
Results obtained by a genetic learning system Boole on a small, abstract learning task are reported and conversion of the decision trees to sets of production rules has led to a significant improvement in classification accuracy for this task.
Machine LearningA general framework for induction and a study of selective induction
82 Citations1986Larry Rendell
PubMedA rule-based process control method with feedback.
33 Citations1987W J Leech
A rule-based control algorithm for process control that includes feedback and modification of the rule base from samples of the process output so that the process is automatically optimized and the rules for controlling the process are automatically generated.
Generating rules from examples
22 Citations1985Bijan Arbab, Donald Michie
An algorithm is implemented for constructing decision trees optimized with respect to linearity and improves on a previous linearizing algorithm (AOCDL) with repect to execution efficiency.
Elsevier eBooksKNOWLEDGE INTENSIVE INDUCTION
20 Citations1989Michel Manago
KATE™ is a knowledge intensive system that learns decision trees, minimally discriminant rules, and maximally characteristic concept descriptions from examples that are related to the G and S sets defined in version space.
Elsevier eBooksTWO ALGORITHMS THAT LEARN DNF BY DISCOVERING RELEVANT FEATURES
19 Citations1989Giulia Pagallo, David Haussler
This chapter discusses two methods that adaptively enlarge the set of primitive attributes from which a test at a decision node can be selected, namely, FRINGE and GREEDY3.
Elsevier eBooksInduction of Decision Trees from Inconclusive Data
19 Citations1989Scott Spangler, Usama M. Fayyad +1 more
The difficult problem of deciding when to stop specialization during top-down decision tree generation is addressed, and a modified version of Quinlan's ID3 algorithm, called INFERULE, is described, which addresses some of the problems involved in learning from inconclusive data.
Interactive induction
15 Citations2003Wray Buntine, David Stirling
The authors identify and discuss a generic induction approach called interactive induction, which offers an alternative method for eliciting subjective information from an expert during the course of knowledge acquisition by involving the expert in the provision of additional subjective knowledge and in the incremental evaluation and validation of knowledge induced.
Elsevier eBooksINDUCTIVE LEARNING WITH BCT
13 Citations1989Philip K. Chan
BCT (Binary Classification Tree) is a system that learns from examples and represents learned concepts as a binary polythetic decision tree that is generally more accurate or comparable to two earlier systems.
Computers and Biomedical ResearchComparison of the ID3 algorithm versus discriminant analysis for performing feature selection
10 Citations1987Evlin L. Kinney, Dennis D. Murphy