Given a Top-Down Induction of Decision Trees:
- Select best decision attribute A for node (e.g. highest reduction in entropy)
- For each value of A, create new descendant of node and sort training examples to leaves
When does this Greedy Approach become an Exact Greedy Algorithm?
Aren't we already considering all the possible splits on all the attributes?