Gini Impurity: Two Equivalent Formulas
Gini Impurity Formulas Gini Impurity: Two Equivalent Formulas Gini impurity is a measure used in decision tree algorithms (like CART) to quantify how “impure” a node is — in other words, how mixed the classes are. ✅ Formula 1: Basic Form G = 1 – Σ(pᵢ²) Where: pᵢ is the probability (or proportion) of class […]
Gini Impurity: Two Equivalent Formulas Read More »