ID5: An Incremental ID3

Abstract

This paper describes ID5, an incremental algorithm that produces decision trees similar to those built by Quinlan's ID3. The principal benefit of ID5 is that new training instances can be processed by revising the decision tree instead of building a new tree from scratch. ID3, ID4, and ID5 are compared theoretically and empirically.

Cite

Text

Utgoff. "ID5: An Incremental ID3." International Conference on Machine Learning, 1988. doi:10.1016/B978-0-934613-64-4.50017-7

Markdown

[Utgoff. "ID5: An Incremental ID3." International Conference on Machine Learning, 1988.](https://mlanthology.org/icml/1988/utgoff1988icml-id/) doi:10.1016/B978-0-934613-64-4.50017-7

BibTeX

@inproceedings{utgoff1988icml-id,
  title     = {{ID5: An Incremental ID3}},
  author    = {Utgoff, Paul E.},
  booktitle = {International Conference on Machine Learning},
  year      = {1988},
  pages     = {107-120},
  doi       = {10.1016/B978-0-934613-64-4.50017-7},
  url       = {https://mlanthology.org/icml/1988/utgoff1988icml-id/}
}