Concept - Decision Tree

Definition (s.297): a decision support tool that uses a tree-like model/graph of decisions and their possible consequences. Built top-down with a divide-and-conquer approach (s.298).

Examples

  • “Should I do exercise today?” (s.297): root “Exercise Yesterday?” - Yes -> Don’t Go; No -> “Eat McSpicy Today?” - Yes -> Go, No -> Don’t Go.
  • “Should I accept a new job offer?” (s.298): root “salary at least $50,000” (no -> decline); yes -> “commute more than 1 hour” (yes -> decline); no -> “offers free coffee” (yes -> accept, no -> decline).

Terminology (s.299)

TermMeaning
Root nodeentire population/sample, further divided into subsets
Splittingdividing a node into two or more sub-nodes
Decision nodesub-node that can be split further
Leaf / Terminal nodenode that does not split
Branch / Sub-treesub-section of the entire tree
Pruningremoving nodes (opposite of splitting)
Parent / child nodea node divided into sub-nodes is the parent; the sub-nodes are its children

Further decision-tree content (splitting criteria etc.) continues after s.300; later chunks may append below.

Source chunk: 03 Text Classification - Chunk 10 (s.271-300)

Overfitting, pruning and ensembles (s.335-337, s.350-353, 03 Text Classification - Chunk 12 (s.331-360))

A fully grown tree overfits noise; see Concept - Decision Tree Pruning (stopping criteria, post-pruning on a validation set). Trees are unstable learners (Concept - Stable and Unstable Learners); ensembles of trees: Concept - Random Forest, Concept - Boosting.

Concept - ID3, Concept - Entropy, Concept - Information Gain, Concept - Gain Ratio, Concept - Gini Impurity, Concept - Overfitting, Concept - Random Forest. Up: 03 Text Classification - Index