2
$\begingroup$

Given a Top-Down Induction of Decision Trees:

  1. Select best decision attribute A for node (e.g. highest reduction in entropy)
  2. For each value of A, create new descendant of node and sort training examples to leaves

When does this Greedy Approach become an Exact Greedy Algorithm?

Aren't we already considering all the possible splits on all the attributes?

$\endgroup$

Your Answer

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

Browse other questions tagged or ask your own question.