ML Anthology

Efficient Incremental Induction of Decision Trees

Dimitrios Kalles, Tim Morris
MLJ 1996 pp. 231-242
doi:10.1007/BF00058613 /mlj/1996/kalles1996mlj-efficient/

Abstract

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.

PDF MLJ Semantic Scholar

Cite

Text

Kalles and Morris. "Efficient Incremental Induction of Decision Trees." Machine Learning, 1996. doi:10.1007/BF00058613

Markdown

[Kalles and Morris. "Efficient Incremental Induction of Decision Trees." Machine Learning, 1996.](https://mlanthology.org/mlj/1996/kalles1996mlj-efficient/) doi:10.1007/BF00058613

BibTeX

@article{kalles1996mlj-efficient,
  title     = {{Efficient Incremental Induction of Decision Trees}},
  author    = {Kalles, Dimitrios and Morris, Tim},
  journal   = {Machine Learning},
  year      = {1996},
  pages     = {231-242},
  doi       = {10.1007/BF00058613},
  volume    = {24},
  url       = {https://mlanthology.org/mlj/1996/kalles1996mlj-efficient/}
}