Question: The ID 3 algorithm could be described as a greedy algorithm as it only considers the best remaining attribute locally, namely at the node at
The ID algorithm could be described as a greedy algorithm as it only
considers the best remaining attribute locally, namely at the node at which it is
branching, and performs no backtracking. Describe why this may lead to a suboptimal
decision tree in the sense that a different selection of attributes may lead to a decision
tree with better performance on a data set
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
