Question

6.4 It is important to calculate the worst-case computational complexity of the decision
tree algorithm. Given data set D, the number of attributes n, and the number of
training tuples jDj, show that the computational cost of growing a tree is at most
njDjlog(jDj). ?

Answer 1

Answer:

loda

fzjgglssffutxg.xmfdkajtfysrfixgusu