ML Anthology

An SE-Tree Based Characterization of the Induction Problem

Ron Rymon
ICML 1993 pp. 268-275
doi:10.1016/B978-1-55860-307-3.50041-1 /icml/1993/rymon1993icml-se/

Abstract

Many induction programs use decision trees both as the basis for their search, and as a representation of their classifier solution. In this paper we propose a new structure, called SE-tree, as a more general alternative.

PDF ICML Semantic Scholar

Cite

Text

Rymon. "An SE-Tree Based Characterization of the Induction Problem." International Conference on Machine Learning, 1993. doi:10.1016/B978-1-55860-307-3.50041-1

Markdown

[Rymon. "An SE-Tree Based Characterization of the Induction Problem." International Conference on Machine Learning, 1993.](https://mlanthology.org/icml/1993/rymon1993icml-se/) doi:10.1016/B978-1-55860-307-3.50041-1

BibTeX

@inproceedings{rymon1993icml-se,
  title     = {{An SE-Tree Based Characterization of the Induction Problem}},
  author    = {Rymon, Ron},
  booktitle = {International Conference on Machine Learning},
  year      = {1993},
  pages     = {268-275},
  doi       = {10.1016/B978-1-55860-307-3.50041-1},
  url       = {https://mlanthology.org/icml/1993/rymon1993icml-se/}
}