Suppose R1 is covered by 350 positive examples and 150 negative ex- amples, while R2 is covered by 300 positive examples and 50 negative examples. Compute the FOIL’s information gain for the rule R2 with respect to R1.
The RIPPER algorithm (by Cohen [1]) is an extension of an earlier algorithm
called IREP (by F ?urnkranz and Widmer [3]). Both algorithms apply the
reduced-error pruning method to determine whether a rule needs to be
pruned. The reduced error pruning method uses a validation set to estimate
the generalization error of a classifier. Consider the following pair of rules:
R2 is obtained by adding a new conjunct, B, to the left-hand side of R1. For
this question, you will be asked to determine whether R2 is preferred over
R1 from the perspectives of rule-growing and rule-pruning. To determine
whether a rule should be pruned, IREP computes the following measure:
where P is the total number of positive examples in the validation set, N is
the total number of negative exampl
For this problem, p0 = 350, n0 = 150, p1 = 300, and n1 = 50. There-
fore, the FOIL’s information gain for R2 with respect to R1 is:
You might also like to view...
What procedure allows a CentOS 7 file system to become available for use?
A. scanning B. structuring C. mounting D. partitioning
In Microsoft Access 2016, _________ is the data type that includes Letters, digits, spaces, and special characters.? A. Hyperlink B. Date/Time C. Long Text D. Yes/No
Fill in the blank(s) with the appropriate word(s).
A(n) ________ is a user defined marker that identifies the beginning and ending of a piece of data
Fill in the blank(s) with correct word
The video clips that users of video message services send are typically how long?
A. 10 seconds B. 30 seconds C. 2 minutes D. 10 minutes or more