Question: It is important to calculate the worst-case computational complexity of the decision tree algorithm. Given data set, D D , the number of attributes, n
It is important to calculate the worst-case computational complexity of the decision tree algorithm. Given data set, DD, the number of attributes, nn, and the number of training tuples, |D||D|, analyze the computational complexity in terms of nn and |D||D|.
Step by Step Solution
3.42 Rating (165 Votes )
There are 3 Steps involved in it
The worstcase scenario occurs when we have to use as many attributes as possible before b... View full answer
Get step-by-step solutions from verified subject matter experts
