Decision tree

As explained in Statistics Every Programmer Needs

A decision tree is a graphical decision-analysis model that represents choices, uncertain events, possible outcomes, probabilities, and payoffs as branching paths.

A decision tree maps a choice under uncertainty as branching paths. Decision nodes represent available actions; chance nodes represent events outside the decision-maker’s control. Chance branches carry probabilities, and their endpoints carry payoffs. Unlike a predictive decision-tree model trained to classify data, this tree evaluates specified choices and possible outcomes. section 10.2

Build the tree before calculating which action to take:

• Identify the main choice and any variables that change the payoff, such as fees. section 10.2.1
• Label decision and chance nodes. List every relevant outcome and assign each chance branch a probability; probabilities leaving one chance node must sum to 1. section 10.2.1
• Attach payoffs to the endpoints. Work backward: multiply each payoff by its branch probability, sum at each chance node, account for costs, then compare the actions’ expected values. section 10.2 section 10.2.1

Compare two contract offers

Suppose one offer pays $120 million. The other has performance-dependent payoffs and a $13 million agent fee. Its expected payoff is $138 million if the player stays healthy and $117 million otherwise. With health probabilities of 0.75 and 0.25, calculate `0.75 * 138 + 0.25 * 117 - 13` in millions: $119.75 million. On these specified payoffs and probabilities, the $120 million offer has the higher expected value. Check the probability and payoff estimates before treating that narrow difference as decisive. section 10.2.1

Figure 10.1 A decision tree that illustrates two very different contract offers. The tree outlines the expected payoffs based on different states of nature, allowing the player to accept the contract with the highest expected value.

The plotted contract tree makes the alternatives, uncertain outcomes, and expected payoffs visible together. section 10.2.2

A readable plot labels probabilities and expected payoffs and visually distinguishes decision nodes from chance nodes. Python’s `anytree.Node` can store the hierarchy; Matplotlib can draw it. The result supports comparison, but its recommendation depends on the supplied probabilities, payoffs, and costs. section 10.2.1 section 10.2.2

How Statistics Every Programmer Needs covers it

How deep it goes

Works through schema construction, probability checks, backward expected-payoff calculations, and plotting rather than predictive-model training.

Examples

Compares baseball contract offers using health, performance incentives, agent fees, branch probabilities, and plotted payoffs.

What it assumes

Assumes probabilities and payoffs can be specified; teaches node types, schema structure, and the probability-sum check explicitly.

What you can do after

Build it from scratch by specifying branches and payoffs, calculating expected values, and plotting the result with Python.

How it connects

Connects expected value, payoff tables, chance nodes, and decision nodes; distinguishes decision analysis from machine-learning decision trees.

liveBookmanning.com

Read Statistics Every Programmer Needs on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Grokking Machine LearningAn algorithm that recursively splits labeled data using feature tests and stopping conditions to construct a decision tree.
• 

  liveBookmanning.com
  Machine Learning for Tabular Data: XGBoost, Deep Learning, and AIA decision tree is a predictive model that recursively partitions inputs using feature-based split rules and produces outcomes at terminal leaves.
• 

  liveBookmanning.com
  Ensemble Methods for Machine LearningA decision tree is a predictive model that recursively partitions data according to feature-based decisions, producing predictions at the resulting leaves.
• 

  liveBookmanning.com
  Statistics Slam DunkA decision tree is a predictive model that recursively partitions data using feature-based decision rules.
• 

  liveBookmanning.com
  Outlier Detection in PythonA decision tree is a hierarchical predictive model that recursively partitions observations using feature-based decision rules.
• 

  liveBookmanning.com
  Grokking AI Algorithms, Second EditionA decision tree is a predictive model that recursively applies feature-based tests to partition examples and produce a classification or regression outcome.
• 

  liveBookmanning.com
  Data Without LabelsA tree-structured predictive model that recursively splits data into nodes using decision rules.
• 

  liveBookmanning.com
  Inside AIA decision tree is a hierarchical predictive model that recursively splits data according to attribute-based questions to reach decisions or predictions.
• 

  liveBookmanning.com
  Machine Learning Algorithms in DepthA decision tree is a hierarchical predictive model that makes decisions by applying feature-based tests at internal nodes.
• 

  liveBookmanning.com
  Machine Learning Platform EngineeringA decision tree is a predictive model that recursively partitions input data using feature-based decision rules.
• 

  liveBookmanning.com
  Demand Forecasting Best PracticesA decision tree is a machine-learning model that makes predictions by applying a sequence of feature-based questions and following the resulting branches to a terminal prediction.
• 

  liveBookmanning.com
  Data-Driven CybersecurityA predictive model that recursively partitions data through feature-based decision rules arranged in a tree structure.

Compare how 13 books explain decision tree →

Related concepts

• leaf nodehas part · A leaf node is a node in a tree or hierarchical structure that has no child nodes and cannot be further subdivided.
• random forestpart of · A random forest is an ensemble model that combines predictions from multiple decision trees built with randomized data samples, feature selections, or both.
• language modelkind of · A language model is a computational model that represents patterns in linguistic tokens to estimate sequence probabilities and predict or generate language from context.
• decision nodehas part · A decision node is a tree node where a decision, test, or action selection determines which successor branch is followed.
• decision stumpincludes · A decision stump is a decision tree of depth one with a single decision node and prediction leaves.
• XGBoostused by · XGBoost is an open-source software library for efficient gradient-boosted decision-tree algorithms used in supervised machine learning.

This explainer was generated by Manning's knowledge graph from the text of Statistics Every Programmer Needs. The section links point to the parts of the book it draws on.