Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
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 negativę examples),

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 negativę examples),

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
4. 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: (a) Rule accuracy. (b) FOIL's information gain. (c) The likelihood ratio statistic. (d) The Laplace measure. (e) The m-estimate measure (with k = 2 and p+ = 0.2).
Transcribed Image Text:4. 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: (a) Rule accuracy. (b) FOIL's information gain. (c) The likelihood ratio statistic. (d) The Laplace measure. (e) The m-estimate measure (with k = 2 and p+ = 0.2).
Expert Solution
Step 1

Given

4. 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: (a) Rule accuracy. (b) FOIL's information gain. (c) The likelihood ratio statistic. (d) The Laplace measure. (e) The m-estimate measure (with k = 2 and p+ = 0.2). 

trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS