Tutorvo

Growing a Two-Level Tree: Leaves & Nested IF Predictions

Lesson 4 of 817 minLab

This lesson is part of the course

In this lesson

You grow Kestrel's first real tree: DTI at the root, income on the left, employment on the right. You fill the four leaves, turn the tree into one nested IF and measure its training accuracy.

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

  1. Entropy & Gini: How Mixed Is a Node?Lab13 min Locked
  2. Information Gain: Scoring Candidate Splits with COUNTIFSLab16 min Locked
  3. The Best Numeric Threshold: Trying Every Cut-PointLab15 min Locked
  4. Growing a Two-Level Tree: Leaves & Nested IF PredictionsLab17 min Locked
  5. Overfitting & Pruning: Train vs Test Accuracy by DepthLab16 min Locked
  6. Bagging & Random Forests: Majority Vote and Out-of-Bag RowsLab16 min Locked
  7. Gradient Boosting by Hand: Residuals, Stumps & a Learning RateLab18 min Locked
  8. Feature Importance from Impurity DecreaseLab15 min Locked