Institute of Information Theory and Automation

You are here

Bibliography

Journal Article

All roads lead to Rome - New search methods for the optimal triangulation problem

Ottosen T. J., Vomlel Jiří

: International Journal of Approximate Reasoning vol.53, 9 (2012), p. 1350-1366

: 1M0572, GA MŠk, 2C06019, GA MŠk, GEICC/08/E010, GA ČR, GA201/09/1891, GA ČR

: Bayesian networks, Optimal triangulation, Probabilistic inference, Cliques in a graph

: 10.1016/j.ijar.2012.06.006

: http://library.utia.cas.cz/separaty/2012/MTR/vomlel-all roads lead to rome - new search methods for the optimal triangulation problem.pdf

(eng): To perform efficient inference in Bayesian networks by means of a Junction Tree method, the network graph needs to be triangulated. The quality of this triangulation largely determines the efficiency of the subsequent inference, but the triangulation problem is unfortunately NP-hard. It is common for existing methods to use the treewidth criterion for optimality of a triangulation. However, this criterion may lead to a somewhat harder inference problem than the total table size criterion. We therefore investigate new methods for depth-first search and best-first search for finding optimal total table size triangulations. The search methods are made faster by efficient dynamic maintenance of the cliques of a graph. This problem was investigated by Stix, and in this paper we derive a new simple method based on the Bron-Kerbosch algorithm that compares favourably to Stix' approach. The new approach is generic in the sense that it can be used with other algorithms than just Bron-Kerbosch.

: BD

2019-01-07 08:39