ML Anthology

An Improved Algorithm for Incremental Induction of Decision Trees

Paul E. Utgoff
ICML 1994 pp. 318-325
doi:10.1016/B978-1-55860-335-6.50046-5 /icml/1994/utgoff1994icml-improved/

Abstract

This paper presents an algorithm for incremental induction of decision trees that is able to handle both numeric and symbolic variables. In order to handle numeric variables, a new tree revision operator called 'slewing' is introduced. Finally, a non-incremental method is given for finding a decision tree based on a direct metric of a candidate tree.

ICML Semantic Scholar

Cite

Text

Utgoff. "An Improved Algorithm for Incremental Induction of Decision Trees." International Conference on Machine Learning, 1994. doi:10.1016/B978-1-55860-335-6.50046-5

Markdown

[Utgoff. "An Improved Algorithm for Incremental Induction of Decision Trees." International Conference on Machine Learning, 1994.](https://mlanthology.org/icml/1994/utgoff1994icml-improved/) doi:10.1016/B978-1-55860-335-6.50046-5

BibTeX

@inproceedings{utgoff1994icml-improved,
  title     = {{An Improved Algorithm for Incremental Induction of Decision Trees}},
  author    = {Utgoff, Paul E.},
  booktitle = {International Conference on Machine Learning},
  year      = {1994},
  pages     = {318-325},
  doi       = {10.1016/B978-1-55860-335-6.50046-5},
  url       = {https://mlanthology.org/icml/1994/utgoff1994icml-improved/}
}