Top-Down Induction of Decision Trees

Main loop: $A \la$ the ``best'' decision attribute for next $node$ Assign $A$ as decision attribute for $node$ For each value of $A$, create new descendant of $node$ Sort training examples to leaf nodes If training examples perfectly classified, Then STOP, Else iterate over new leaf nodes

Which attribute is best?

file=./bookps/dt-s1.ps,width=6in