Skip to content

Latest commit

 

History

History
6 lines (4 loc) · 266 Bytes

File metadata and controls

6 lines (4 loc) · 266 Bytes

Construct a data set (set of examples with attributes and classifications) that would cause the decision-tree learning algorithm to find a non-minimal-sized tree. Show the tree constructed by the algorithm and the minimal-sized tree that you can generate by hand.