Decision trees
Build the tree in two steps
- Build a perfect tree on sample data
- At each node, pick a “good” attribute
- Split data according to attribute
- Recursively build tree on children
- Prune the tree
- Minimum Description Length
- Cost of encoding tree structure
- Cost of encoding split attribute
- Cost of encoding leaf data records