The Laplace measure.
Consider a training set that contains 100 positive examples and 400 negative
examples. For each of the following candidate rules,
R1: A ?? + (covers 4 positive and 1 negative examples),
R2: B ?? + (covers 30 positive and 10 negative examples),
R3: C ?? + (covers 100 positive and 90 negative examples),
determine which is the best and worst candidate rule according to:
Computer Science & Information Technology