Question: 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
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.
Step by Step Solution
3.43 Rating (169 Votes )
There are 3 Steps involved in it
The decisiontree algorithm is greedy it selects the single attribute which give the most i... View full answer
Get step-by-step solutions from verified subject matter experts
