Start here
Decision Trees, in plain language
Hierarchical split-based classification and regression. Trees turn nonlinear interactions into interpretable rules and form the basis of high-performing tabular ensembles.
For a small example, classify six fruits using color and weight. Compare candidate thresholds by impurity reduction and draw the two resulting leaves. This is the mechanism to keep in view as the lesson becomes more technical. Before moving on, identify the input, transformation, output, and one observation that would falsify your conclusion.
Key points
- Recursive binary splits, leaves, depth, and prediction rules.
- Gini, entropy, variance reduction, and greedy search.
- Overfitting, pruning, and bias-variance behavior.