Construct a decision-tree classifier with binary splits at each node, using tuples in relation r(A, B,C) shown below as training data; attribute Cdenotes the class. Show the final tree, and with each node show the best split for each attribute along with its information gain value.
(1, 2, a), (2, 1, a), (2, 5, b), (3, 3, b), (3, 6, b), (4, 5, b), (5, 5, c), (6, 3, b), (6, 7, c)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.