Decision Trees

Decision Trees: Decision Trees, Reading a Decision Tree.

Updated

  1. Decision Trees (Journeyman): A decision tree sorts examples into classes with yes-or-no questions about their features, picking each question so the groups it makes are as unmixed as possible (the Gini impurity), with max_depth to limit how many questions it asks and no need to rescale the features first.
  2. Reading a Decision Tree (Journeyman): A decision tree's rules can be printed with export_text or drawn with plot_tree, one fruit's guess can be said as a sentence by following its path from the top question to a leaf, and the leaf's mix of training fruits is the probability the tree gives, but a deep tree's rules stop being readable and every rule describes the training data, not the world.