-
Book Overview & Buying
-
Table Of Contents
Causal Inference with Bayesian Networks
By :
This chapter introduces join tree (junction tree) clustering as a practical method for transforming a Bayesian network’s directed acyclic graph (DAG) into a tree-decomposable structure that supports efficient, exact inference. You will learn the key graph transformations—moralization and triangulation—along with the core structural ideas behind chordal graphs, simplicial nodes, perfect elimination orderings, and maximum cardinality search (MCS). Additionally, you will discover how to identify maximal cliques, assemble them into a join tree that satisfies the running intersection property (RIP), and understand why this tree structure enables scalable inference. Throughout, hands-on R examples show how to construct and query graphs, verify d-separation and separation, and implement the algorithms for tree clustering from start to finish using common graph libraries.
In this chapter we’re going to cover the following main topics:
...