Join free to take this lesson
Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.
10 steps ยท about 18 min
By the end you can
- Compute the Gini impurity of a node and the weighted impurity of a split
- Explain why averaging many trees lowers variance, and compute the variance of an average of correlated trees
- Carry out one boosting update
Who it is for: You know classification (lesson 15.3) and the bias-variance trade-off (lesson 15.1).
The steps
- One expert or a crowd?
- How a tree splits
- Gini impurity of a node
- Weighted impurity of a split
- Many trees: bagging and random forests
- Variance of a forest
- Boosting
- One boosting step
- Forests or boosting?
- Why not one perfect tree?
Discussion 0 comments
Log in to join the discussion.