Question

(a) Find decision tree based greedy algorithm with on error rate split (b) Find decision tree based on global search (full calculations), assume ties are broken by choosing the smallest Dataset: Output Y, Attributes A, B, C Y A B C + 0 0 0 + 0 0 1 - 0 1 0 + 0 1 1 - 1 0 0 - 1 0 1 - 1 1 0 + 1 1 1

          (a) Find decision tree based greedy algorithm with on error rate split
(b) Find decision tree based on global search (full calculations), assume ties
are broken by choosing the smallest
Dataset:
Output Y, Attributes A, B, C
Y
A
B
C
+
0
0
0
+
0
0
1
-
0
1
0
+
0
1
1
-
1
0
0
-
1
0
1
-
1
1
0
+
1
1
1

(a) Find decision tree based greedy algorithm with on error rate split
(b) Find decision tree based on global search (full calculations), assume ties
are broken by choosing the smallest
Dataset:
Output Y, Attributes A, B, C
Y
A
B
C
+
0
0
0
+
0
0
1
-
0
1
0
+
0
1
1
-
1
0
0
-
1
0
1
-
1
1
0
+
1
1
1

Added by Tom C.

Elementary and Intermediate Algebra

Alan S. Tussy, R. David Gustafson 5th Edition

Instant Answer

Solved by Expert Bradley Duda

Step 1

(a) Decision tree based greedy algorithm with on error rate split: Show more…

Show all steps

Thanks for your feedback!

(a) and (b) Please Thank You (a) Find decision tree based greedy algorithm with on error rate split (b) Find decision tree based on global search (full calculations), assume ties are broken by choosing the smallest Dataset: Output Y, Attributes A,B, € C A %