Conference paper

Vomlel J., Savický P.

Proceedings of the 8th Workshop on Uncertainty Processing

University of Economics, Prague

Praha

2009

978-80-245-1543-1

Ing. Jiří Vomlel, Ph.D. (ÚTIA - Oddělení matematické teorie rozhodování)

Bayesian networks, bipartite graphs, graph triangulation

In this paper we present results of experimental comparisons of several triangulation heuristics on bipartite graphs. Our motivation for testing heuristics on the family of bipartite graphs is the rank-one decomposition of BN2O networks. A BN2O network is a Bayesian network having the structure of a bipartite graph with all edges directed from the top level toward the bottom level and where all conditional probability tables are noisy-or gates. After applying the rank-one decomposition, which adds an extra level of auxiliary nodes in between the top and bottom levels, and after removing simplicial nodes of the bottom level we get so called BROD graph. This is an undirected bipartite graph. It is desirable for efficiency of the inference to find a triangulation of the BROD graph having the sum of table sizes for all cliques of the triangulated graph as small as possible. From this point of view, the minfill heuristics perform in average better than other tested heuristics (minwidth, h1, and mcs).