Decision Tree, Entropy, Information Gain, Gini Index.
recursively finds the node with the “weakest link”. The weakest link is characterized by an effective alpha, where the nodes with the smallest effective alpha are pruned first. https://scikit-learn.org/stable/auto_examples/tree/plot_cost_complexity_pruning.html What does this mean? It means that