Bayes can be read as a geometric operation on the tree: the transformation that takes the tree ” knowing ” to the tree ” knowing ”.
In brief — A three-step algorithm
Given the “direct” tree with first level and second under each , with the branches weighted as (first) and , (second):
- Joint probabilities on the paths: for each leaf, (product along the path).
- Marginalisation: sum over the paths that end in : .
- Inverted branch: .
Building the “inverted” tree with first level and second , the branches at the first level are and those at the second level are the just computed.
Example — Direct tree vs inverted tree, rare disease
We take up the example again: , , .
Direct tree (first level: disease; second: test):
Direct tree: first the disease, then the test outcome conditioned on the disease.
Step 1 — joint probabilities: Step 2 — marginalisation: Step 3 — inverted branches:
Inverted tree (first level: test; second: disease):
Inverted tree: first the test outcome, then the disease conditioned on the test. Same leaves, opposite conditioning.
The inverted tree contains exactly the same information as the direct one (the leaves have the same joint probabilities ), but reads the data with the opposite conditioning: now the question “given the test, what is the prob. of the disease” is immediate. It is the visual version of Bayes.
Links
Topics: Probability
Concepts: Tree diagram · Tree inversion · Conditional probability · Bayes’ theorem
Methods: Bayes · Bayes tree inversion · Total prob
Skills: Calculating probability · Modelling