Log In Sign Up

On Triangulating Dynamic Graphical Models

by   Jeff A. Bilmes, et al.

This paper introduces new methodology to triangulate dynamic Bayesian networks (DBNs) and dynamic graphical models (DGMs). While most methods to triangulate such networks use some form of constrained elimination scheme based on properties of the underlying directed graph, we find it useful to view triangulation and elimination using properties only of the resulting undirected graph, obtained after the moralization step. We first briefly introduce the Graphical model toolkit (GMTK) and its notion of dynamic graphical models, one that slightly extends the standard notion of a DBN. We next introduce the 'boundary algorithm', a method to find the best boundary between partitions in a dynamic model. We find that using this algorithm, the notions of forward- and backward-interface become moot - namely, the size and fill-in of the best forward- and backward- interface are identical. Moreover, we observe that finding a good partition boundary allows for constrained elimination orders (and therefore graph triangulations) that are not possible using standard slice-by-slice constrained eliminations. More interestingly, with certain boundaries it is possible to obtain constrained elimination schemes that lie outside the space of possible triangulations using only unconstrained elimination. Lastly, we report triangulation results on invented graphs, standard DBNs from the literature, novel DBNs used in speech recognition research systems, and also random graphs. Using a number of different triangulation quality measures (max clique size, state-space, etc.), we find that with our boundary algorithm the triangulation quality can dramatically improve.


page 1

page 4

page 5

page 7


A Concise Function Representation for Faster Exact MPE and Constrained Optimisation in Graphical Models

We propose a novel concise function representation for graphical models,...

The Relationship Between AND/OR Search and Variable Elimination

In this paper we compare search and inference in graphical models throug...

Inference for Multiplicative Models

The paper introduces a generalization for known probabilistic models suc...

IPF for Discrete Chain Factor Graphs

Iterative Proportional Fitting (IPF), combined with EM, is commonly used...

Efficient Bayesian network structure learning via local Markov boundary search

We analyze the complexity of learning directed acyclic graphical models ...

An N Time-Slice Dynamic Chain Event Graph

The Dynamic Chain Event Graph (DCEG) is able to depict many classes of d...

Intervention in undirected Ising graphs and the partition function

Undirected graphical models have many applications in such areas as mach...