Triangulation by Continuous Embedding

Abstract

When triangulating a belief network we aim to obtain a junction tree of minimumstate space. According to [8], searching for the optimal triangulation can be cast as a search over all the permutations of the network's variables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function… (More)

Topics

5 Figures and Tables

Slides referencing similar topics