why does ID3 Decision tree algorithm not give the best decision tree? I was going through ID3 algorithm, and what I believe is it incorporates Greedy Search rule to get come up with the decision tree. If it gives the best split possible at every stage, how does it not give the best decision tree possible?
If you want the best decision tree, you need the &quot;optimal decision tree&quot;, which you can get nowadays. Just have a look into the vast literature.