Description
1. Consider the following data set for a binary class problem and consider building a decision tree using this data
Feature A Feature B Class Label
T F +
T T +
T T +
T F –
T T +
F F –
F F –
F F –
T T –
T F –
• Write a formula for the information gain when splitting on feature A. • Write a formula for the information gain when splitting on feature B.
• Which feature would the decision tree induction algorithm choose?
2. Load the 2021SM2-Week9 _lab.ipynb jupyter notebook and complete thepractical exercises
1
