ML Anthology

Possibilistic Induction in Decision-Tree Learning

Eyke Hüllermeier
ECML-PKDD 2002 pp. 173-184
doi:10.1007/3-540-36755-1_15 /ecmlpkdd/2002/hullermeier2002ecml-possibilistic/

Abstract

We propose a generalization of Ockham’s razor, a widely applied principle of inductive inference. This generalization intends to capture the aspect of uncertainty involved in inductive reasoning. To this end, Ockham’s razor is formalized within the framework of possibility theory: It is not simply used for identifying a single, apparently optimal model, but rather for concluding on the possibility of various candidate models. The possibilistic version of Ockham's razor is applied to (lazy) decision tree learning.

PDF ECML-PKDD Semantic Scholar

Cite

Text

Hüllermeier. "Possibilistic Induction in Decision-Tree Learning." European Conference on Machine Learning, 2002. doi:10.1007/3-540-36755-1_15

Markdown

[Hüllermeier. "Possibilistic Induction in Decision-Tree Learning." European Conference on Machine Learning, 2002.](https://mlanthology.org/ecmlpkdd/2002/hullermeier2002ecml-possibilistic/) doi:10.1007/3-540-36755-1_15

BibTeX

@inproceedings{hullermeier2002ecml-possibilistic,
  title     = {{Possibilistic Induction in Decision-Tree Learning}},
  author    = {Hüllermeier, Eyke},
  booktitle = {European Conference on Machine Learning},
  year      = {2002},
  pages     = {173-184},
  doi       = {10.1007/3-540-36755-1_15},
  url       = {https://mlanthology.org/ecmlpkdd/2002/hullermeier2002ecml-possibilistic/}
}