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

Decision Trees

25 / 31

Previous Index Next

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)

See Answer

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

Previous Index Next

Please login to comment

0 Comments

There are 3 new comments.