Question: Apply the Decision Tree(DT) algorithm to the training data in below table and clearly mention all steps and calculations of Entropy and Information Gain. Make
Apply the Decision Tree(DT) algorithm to the training data in below table and clearly mention all steps and calculations of Entropy and Information Gain. Make Decision Tree after applying calculations.
| S# | Holiday | Weather | Paper | Picnic (Category) |
| 1 | Yes | Rainy | easy | No |
| 2 | Yes | Rainy | Difficult | No |
| 3 | Yes | Rainy | Difficult | Yes |
| 4 | Yes | Sunny | Difficult | Yes |
| 5 | Yes | Sunny | easy | Yes |
| 6 | Yes | Sunny | easy | No |
| 7 | Yes | Rainy | Difficult | No |
| 8 | Yes | Sunny | Difficult | Yes |
| 9 | No | Sunny | Difficult | No |
- Which attribute would information gain choose as the root of the tree?
- Draw the decision tree that would be constructed by recursively applying information gain to select roots of sub-trees, as in the Decision-Tree-Learning algorithm.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
