%0 Conference Paper %1 frnkranz1994incremental %A Fürnkranz, Johannes %A Widmer, Gerhard %B ICML %D 1994 %E Cohen, William W. %E Hirsh, Haym %I Morgan Kaufmann %K %P 70-77 %T Incremental Reduced Error Pruning %X 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. %@ 1-55860-335-2

@inproceedings{frnkranz1994incremental, 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. }, added-at = {2016-07-04T12:36:53.000+0200}, author = {Fürnkranz, Johannes and Widmer, Gerhard}, biburl = {https://www.bibsonomy.org/bibtex/2c543ab882fa10fbd6de0ee6b1f55fa1c/nosebrain}, booktitle = {ICML}, crossref = {conf/icml/1994}, editor = {Cohen, William W. and Hirsh, Haym}, interhash = {a91f9ac878718977b77293fbbccf695e}, intrahash = {c543ab882fa10fbd6de0ee6b1f55fa1c}, isbn = {1-55860-335-2}, keywords = {}, pages = {70-77}, publisher = {Morgan Kaufmann}, timestamp = {2016-07-04T12:36:53.000+0200}, title = {Incremental Reduced Error Pruning}, year = 1994 }