📖 Cost Complexity Pruning

For each $\\alpha \\geq 0$, find subtree $T$ minimizing $\\sum_{m=1}^{|T|}\\sum_{i: x_i \\in R_m}(y_i - \\hat{y}_{R_m})^2 + \\alpha|T|$ where $|T|$ is number of terminal nodes.

From: Intro to Statistical Learning

Learn more: https://mathacademy-cyan.vercel.app/#/section/36

Explore all courses: https://mathacademy-cyan.vercel.app