Efficient Incremental Induction of Decision Trees

  • Kalles D
  • Morris T
  • 37


    Mendeley users who have this article in their library.
  • 33


    Citations of this article.


This paper proposes a method to improve ID5R, an incremental TDIDT algorithm. The new method evaluates the quality of attributes selected at the nodes of a decision tree and estimates a minimum number of steps for which these attributes are guaranteed such a selection. This results in reducing overheads during incremental learning. The method is supported by theoretical analysis and experimental results.

Author-supplied keywords

  • Incremental algorithm
  • decision tree induction

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Dimitrios Kalles

  • Tim Morris

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free