Searching for "Incremental Reduced Error Pruning." – sorted by Relevance.
-
Incremental Reduced Error Pruning
- Incremental Reduced Error Pruning Johannes Furnkranz 1 and Gerhard Widmer 1;2 1 Austrian
- Cited by 84 (19 self) – Add To MetaCart
-
Maximizing the Area under the ROC Curve Using Incremental Reduced Error Pruning
- Maximizing the Area under the ROC Curve using Incremental Reduced Error Pruning Henrik Boström
- Cited by 2 (0 self) – Add To MetaCart
-
Pruning and exclusion criteria for unordered incremental reduced error pruning
- Pruning and Exclusion Criteria for Unordered Incremental Reduced Error Pruning Henrik Boström
- Cited by 2 (1 self) – Add To MetaCart
-
Pruning Methods for Rule Learning Algorithms
- - and Post Pruning with Incremental Reduced Error Pruning be selected. A wrong choice of a literal cannot
- Cited by 1 (1 self) – Add To MetaCart
-
Fast Effective Rule Induction
- ] proposed a novel learning algorithm called incremental reduced error pruning (IREP). IREP was shown
- Cited by 654 (19 self) – Add To MetaCart
-
Inductive Logic Programming
- -28.ps.Z). and post-pruning, and finally Incremental Reduced Error Pruning (I-REP), a very efficient
- Add To MetaCart
-
Pruning Decision Trees and Lists
- .1.1 Reduced-error pruning for rules . . . . . . . . . . . . . . . . . 108 5.1.2 Incremental reduced-error
- Cited by 8 (0 self) – Add To MetaCart
-
Development of Methods How to Avoid the Overfitting-Effect within the GeLog-System
- learning algorithm and its exact balancing indispensable. As an example, the Incremental-Reduced-Error-Pruning
- Add To MetaCart
-
Classifying Uncovered Examples by Rule Stretching
- induction was used together with incremental reduced error pruning [5], by which a generated rule
- Cited by 3 (1 self) – Add To MetaCart
-
A Tight Integration of Pruning and Learning (Extended Abstract)
- of examples. 3 I-REP Incremental Reduced Error Pruning (I-REP) [Furnkranz and Widmer, 1994] was motivated
- Cited by 2 (1 self) – Add To MetaCart

