Popular Courses
Linear Regression
Introduction
Decision Trees
Introduction
Neural Networks
Introduction

Sign in to Curvingo

or

New Account     Reset Password     

Decision Trees
Introduction
Decision Tree
Where To Partition?
Information Gain
Another Look At Our Decision Tree
The Problem of Perturbations
Going Beyond A Single Tree
Built with Mathigon

Share

Send us Feedback

Please let us know if you have any feedback and suggestions, or if you find any errors and bugs in our content.

Sorry, your message couldn’t be submitted. Please try again!

Thanks for your feedback!

Reset Progress

This will delete your progress and chat data for all chapters in this course, and cannot be undone!

Glossary

Select one of the keywords on the left…

Decision TreesGoing Beyond A Single Tree

Reading time: ~5 min

If one highly-sensitive Decision Tree is prone to wild, unpredictable changes, how do we fix the problem?

Ironically, the solution is to introduce even more randomness.

Instead of relying on the prediction of one massive, overfitted tree, what if we trained a large collection of perfectly pruned Decision Trees on slightly different, randomized subsets of the data? When we need to make a prediction, we just ask all the trees to vote on the answer!

Because they are voting as a group, they no longer suffer from high variance or instability. This brilliant approach opens the door to arguably the most famous and successful algorithm in classical Machine Learning: .

Sina