Graphical Models and Inference - Lecture 6

Junction trees 

This lecture is concerned with properties of junction trees and algorithms for constructing them. Junction trees are essential structures for local computation, enabling efficient calculation in large graphical models.  Reading material for this lecture can be found in Cowell et al. (1999), Chapter 4.



Next lecture

Previous lecture

Course overview

Last updated: Friday, 28 October 2011Steffen L. Lauritzen