ML Anthology

Incremental Reduced Error Pruning

Johannes Fürnkranz, Gerhard Widmer
ICML 1994 pp. 70-77
doi:10.1016/B978-1-55860-335-6.50017-9 /icml/1994/furnkranz1994icml-incremental/

Abstract

This paper outlines some problems that may occur with Reduced Error Pruning in relational learning algorithms, most notably efficiency. Thereafter a new method, Incremental Reduced Error Pruning, is proposed that attempts to address all of these problems. Experiments show that in many noisy domains this method is much more efficient than alternative algorithms, along with a slight gain in accuracy. However, the experiments show as well that the use of the algorithm cannot be recommended for domains which require a very specific concept description.

ICML Semantic Scholar

Cite

Text

Fürnkranz and Widmer. "Incremental Reduced Error Pruning." International Conference on Machine Learning, 1994. doi:10.1016/B978-1-55860-335-6.50017-9

Markdown

[Fürnkranz and Widmer. "Incremental Reduced Error Pruning." International Conference on Machine Learning, 1994.](https://mlanthology.org/icml/1994/furnkranz1994icml-incremental/) doi:10.1016/B978-1-55860-335-6.50017-9

BibTeX

@inproceedings{furnkranz1994icml-incremental,
  title     = {{Incremental Reduced Error Pruning}},
  author    = {Fürnkranz, Johannes and Widmer, Gerhard},
  booktitle = {International Conference on Machine Learning},
  year      = {1994},
  pages     = {70-77},
  doi       = {10.1016/B978-1-55860-335-6.50017-9},
  url       = {https://mlanthology.org/icml/1994/furnkranz1994icml-incremental/}
}