Incremental Induction of Decision Trees

  • Authors:
  • Paul E. Utgoff

  • Affiliations:
  • Department of Computer and Information Science, University of Massachusetts, Amherst, MA 01003. UTGOFF@CS.UMASS.EDU

  • Venue:
  • Machine Learning
  • Year:
  • 1989

Quantified Score

Hi-index 0.01

Visualization

Abstract

This article presents an incremental algorithm for inducing decision trees equivalent to those formed by Quinlan's nonincremental ID3 algorithm, given the same training instances. The new algorithm, named ID5R, lets one apply the ID3 induction process to learning tasks in which training instances are presented serially. Although the basic tree-building algorithms differ only in how the decision trees are constructed, experiments show that incremental training makes it possible to select training instances more carefully, which can result in smaller decision trees. The ID3 algorithm and its variants are compared in terms of theoretical complexity and empirical behavior.