If the number of features in n and number of... | Automated hands-on| CloudxLab

If the number of features in n and number of training set instances is m then the complexity of training of a decision tree is

O(nmlog(m))
O(mlog(n))
O(nlog(m))
O(mn)

Note - Having trouble with the assessment engine? Follow the steps listed here

Enroll Now

Loading comments...