Decision Tree: Gini Impurity & the Best Split
This lesson is part of the course
In this lesson
You do what a decision tree does at its first node: measure the Gini impurity of two candidate splits and pick the better one.
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
- Train/Test Split & Feature Scaling Locked
- Linear Regression: Normal Equations vs SLOPE Locked
- Gradient Descent by Hand Locked
- Logistic Regression: Sigmoid Scores & Log-Loss Locked
- Confusion Matrix, Precision, Recall & F1 Locked
- k-Nearest Neighbours: Distances & a k = 3 Vote Locked
- k-Means Clustering: One Iteration by Hand Locked
- Decision Tree: Gini Impurity & the Best Split Locked