The CN2 Induction Algorithm
Machine LearningPublished 1 March 1989Open access
Peter Clark, Tim Niblett
Citations2,015
SJR quartileQ1
SJR score1.15
SNIP2.14
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
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.
Abstract
Systems for inducing concept descriptions from examples are valuable tools for assisting in the task of knowledge acquisition for expert systems. This paper presents 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. Implementations of the CN2, ID3, and AQ algorithms are compared on three medical classification tasks.
Keywords
Computer Science
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 LearningLearning Efficient Classification Procedures and Their Application to Chess End Games
1,106 Citations1983J. R. Quinlan
A series of experiments dealing with the discovery of efficient classification procedures from large numbers of examples is described, with a case study from the chess end game king-rook versus king-knight.
Choice Reviews OnlineProbability and statistical inference
881 Citations2008
These lectures introduce key concepts in probability and statistical inference at a level suitable for graduate students in particle physics to paint as vivid a picture as possible.
Machine LearningLearning Decision Lists
761 Citations1987Ronald L. Rivest
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples, and strictly increases the set of functions known to be polynomially learnable, in the sense of Valiant (1984).
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.
Generating production rules from decision trees
474 Citations1987J. R. Quinlan
This paper describes a technique for transforming such trees to small sets of production rules, a common formalism for expressing knowledge in expert systems, and provides a way of combining different decision trees for the same classification domain.
Sequential Analysis
446 Citations1947Wald, Abraham
Machine LearningLearning decision lists
355 Citations1987Ronald L. Rivest
This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples, and strictly increases the set of functions known to be polynomially learnable, in the sense of Valiant (1984).
Machine LearningLEARNING EFFICIENT CLASSIFICATION PROCEDURES AND THEIR APPLICATION TO CHESS END GAMES
282 Citations1983J. R. Quinlan
A series of experiments dealing with the discovery of efficient classification procedures from large numbers of examples is described, with a case study from the chess end game king-rook versus king-knight.
International Journal of Human-Computer StudiesSimplifying decision trees
267 Citations1999J. R. Quinlan
Elsevier eBooksTrading Off Simplicity and Coverage in Incremental Concept Learning
91 Citations1988Wayne Iba, James Wogulis +1 more
It is shown that HILLARY's performance deteriorates linearly with the amount of noise, independent of the memory limitations, and that small improvements in performance are gained at the expense of large increases in the number of disjuncts demonstrating the relevance and importance of the tradeoff.
Incremental Generation of VL1 Hypotheses: The Underlying Methodology and the Description of Program AQ11
47 Citations1983Ryszard S. Michalski