Since decision tree algorithm splits the training dataset one feature at a time, how the heck is possibly that it suffers from curse of dimensionality ?

  • $\begingroup$ Since you will have a lot of dimensions to split on and adding more and more might help(who knows).. But we generally select randomly some columns while building it acc to different algos $\endgroup$
    – Aditya
    May 18 '18 at 9:23

Every machine learning algorithm suffers from curse of dimensional to different degrees. The primary issue is the sparsity of observations as the number of dimensions increase.

Since decision trees are greedy, they are one of the most robust machine learning algorithms to sparsity. Decision trees will automatically find the single feature to that best creates the most pure regions. This process is recursively repeated. Decision trees will learn to ignore dimensions that are less informative.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.