Bagging & Random Forests: Majority Vote and Out-of-Bag Rows
This lesson is part of the course
In this lesson
You combine five trees into a random forest: count the votes, turn them into a probability and a prediction, show that the forest beats every single tree, and count the out-of-bag rows of a bootstrap sample.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Entropy & Gini: How Mixed Is a Node? Locked
- Information Gain: Scoring Candidate Splits with COUNTIFS Locked
- The Best Numeric Threshold: Trying Every Cut-Point Locked
- Growing a Two-Level Tree: Leaves & Nested IF Predictions Locked
- Overfitting & Pruning: Train vs Test Accuracy by Depth Locked
- Bagging & Random Forests: Majority Vote and Out-of-Bag Rows Locked
- Gradient Boosting by Hand: Residuals, Stumps & a Learning Rate Locked
- Feature Importance from Impurity Decrease Locked