1
$\begingroup$

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?

$\endgroup$
2
  • $\begingroup$ It's a local optimum, not a global one. All tree building algorithms are merely heuristics. $\endgroup$ Oct 5 '18 at 10:24
  • $\begingroup$ Greedy algorithms only rarely guarantee a globally optimal solution. $\endgroup$ Nov 9 '20 at 15:32
1
$\begingroup$

If you want the best decision tree, you need the "optimal decision tree", which you can get nowadays. Just have a look into the vast literature.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.