Divide-And-Conguer Algorithms o Family of decision tree learning algorithms TDIDT: Top-Down Induction of Decision Trees O Learn trees in a Top-Down fashion divide the problem in subproblems solve each problem Basic Divide-And-Conquer Algorithm 1. select a test for root node Create branch for each possible outcome of the test 2. split instances into subsets One for each branch extending from the node 3. repeat recursively for each branch, using only instances that reach the branch 4. stop recursion for a branch if all its instances have the same class11 Divide-And-Conquer Algorithms ⚫Family of decision tree learning algorithms • TDIDT: Top-Down Induction of Decision Trees ⚫Learn trees in a Top-Down fashion • divide the problem in subproblems • solve each problem