Basic introduction to Decision tree's Algorithm
QUESTIONS:
A |
B |
C |
D |
Output |
Some |
High |
False |
French |
Yes |
Full |
Low |
False |
Thai |
No |
Some |
Low |
False |
Burger |
Yes |
Full |
Low |
False |
Thai |
Yes |
Full |
High |
False |
French |
No |
Some |
Normal |
True |
Italian |
Yes |
None |
Low |
True |
Burger |
No |
Some |
Normal |
True |
Thai |
Yes |
Full |
Low |
True |
Burger |
No |
Full |
High |
False |
Italian |
No |
None |
Low |
False |
Thai |
Yes |
Full |
Low |
False |
Burger |
Yes |
- Create a ID3 decision tree. Calculate entropy and Information gain at each step. Using the same training set as testing set, calculate all possible metrics.
- For the above tree, calculate recall, precision and F1 score.