Random forests: bagging, bootstrap and decorrelated trees

Why averaging trees helps: bagging (bootstrap aggregating), out-of-bag error, and how random forests lower tree correlation ρ in ρσ² + (1−ρ)σ²/B.

Part of Trees and ensembles.

Read first

Read next

  • k-means clustering and k-means++

    How k-means clustering groups unlabelled points: Lloyd's algorithm never raises its objective but can stick at a local optimum; k-means++ starts it well.