# junction trees

(2.4 hours to learn)

## Summary

The sum-product algorithm is a way of computing marginals in a tree-structured graphical model. The junction tree algorithm generalizes this to arbitrary graphs by grouping together variables into cliques, such that the cliques form a tree.

## Context

This concept has the prerequisites:

- variable elimination (We can construct junction trees using variable elimination.)
- sum-product on trees (Junction trees are a way of applying exact BP to arbitrary graphs.)

## Core resources (read/watch one of the following)

## -Free-

→ Coursera: Probabilistic Graphical Models (2013)

An online course on probabilistic graphical models.

Other notes:

- Click on "Preview" to see the videos.

## -Paid-

→ Machine Learning: a Probabilistic Perspective

A very comprehensive graudate-level machine learning textbook.

Location:
Section 20.4, pages 720-726

## Supplemental resources (the following are optional, but you may find them useful)

## -Paid-

→ Probabilistic Graphical Models: Principles and Techniques

A very comprehensive textbook for a graduate-level course on probabilistic AI.

Location:
Chapter 10, pages 345-377

## See also

-No Additional Notes-