Decision trees: Gini, entropy and greedy splits

How a decision tree picks each split greedily by Gini impurity or entropy, and why a tree grown until every leaf is pure overfits.

Part of Trees and ensembles.

Read next

Related

  • Finish first

    The greedy choice for interval scheduling: book the meeting that ends first to fit the most, why other greedy rules fail, and the stays-ahead proof.