Question: Consider the training examples shown in Table 4.2 for a binary classification problem. (a) What is the entropy of this collection of training examples with
(a) What is the entropy of this collection of training examples with respect to the positive class?
(b) What are the information gains of a1 and a2 relative to these training examples?
(c) For a3, which is a continuous attribute, compute the information gain for every possible split.
(d) What is the best split (among a1, a2, and a3) according to the information gain?
(e) What is the best split (between a1 and a2) according to the classification error rate?
(f) What is the best split (between a1 and a2) according to the Gini index?
Step by Step Solution
3.32 Rating (170 Votes )
There are 3 Steps involved in it
a There are four positive examples and five negative examples Thus P 49 and P 59 The entropy of th... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
908-M-S-D-A (8609).docx
120 KBs Word File
