Decision-Tree Learning

• The function learned is disjunctive-normal-form formulas

  • (a1 = v11) ^ (a2 = v12) ^ … ^ (an = v1n) => y = y1k
  • (a1 = v21) ^ (a2 = v22) ^ … ^ (an = v2n) => y = y2k

(often the vij and yij values are either TRUE or FALSE)

• The tree representation has an attribute at each node and one child for each value that attribute can take on.

A

B

C

T

D

E

E

F

T

F

F

F

A=a1

A=a2

A=a3

B=T

B=F

Previous slide

Next slide

Back to first slide

View graphic version