Q37
Which among the following statements best describes our approach to learning decision trees
A.
identify the best partition of the input space and response per partition to minimise sum of squares error
B.
identify the best approximation of the above by the greedy approach (to identifying the partitions)
AnswerC.
identify the model which gives the best performance using the greedy approximation (option (b)) with the smallest partition scheme
D.
identify the model which gives performance close to the best greedy approximation performance (option (b)) with the smallest partition scheme
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board