next up previous
Next: ch3 Up: ch3 Previous: ch3

Decision Trees

Decision tree representation: Each internal node tests an attribute Each branch corresponds to attribute value Each leaf node assigns a classification


How would we represent: $\tand, \tor,$ XOR $(A \tand B) \tor (C \tand \neg D \tand E)$ $M$ of $N$



Don Patterson 2001-12-13