Next: Confidence Intervals [3 P]
Previous: Entropy and Information Gain
In a decision tree with only binary splits, an attribute may be selected more than once as splitting criterion. In this exercise you should construct a decision tree with only binary splits which classifies data according to two attributes
into two classes
. Figure 1 shows the connection between attributes and class membership:
Training data from classes A (green) and B (red).
- Sketch the shape of a binary decision tree for this training set. Explain what leads to this shape.
- What would you do to train a qualitatively better decision tree?