Induction of Decision Trees
Abstract¶
The technology for building knowledge-based systems by inductive inference from examples has been demonstrated successfully in several practical applications. 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. Results from recent studies show ways in which the methodology can be modified to deal with information that is noisy and/or incomplete. A reported shortcoming of the basic algorithm is discussed and two means of overcoming it are compared.
Summary¶
Introduces ID3, a decision tree induction algorithm using information gain (entropy reduction) as the splitting criterion. ID3 popularized top-down inductive learning of decision trees and directly motivated C4.5, CART, and the broader field of tree-based machine learning.
Links¶
Knowledge Base
External
Tags¶
Similar Papers¶
Greedy Function Approximation: A Gradient Boosting Machine
Gradient Boosted Trees
Unbiased Recursive Partitioning: A Conditional Inference Framework
Conditional Inference Trees