Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms (original) (raw)

Statistics and Computing, 1997

Abstract

In this paper we consider the optimal decomposition of Bayesian networks. More concretely, we examine empirically the applicability of genetic algorithms to the problem of the triangulation of moral graphs. This problem constitutes the only difficult step in the evidence propagation algorithm of Lauritzen and Spiegelhalter (1988) and is known to be NP-hard (Wen, 1991). We carry out experiments with

Cindy Kuijpers hasn't uploaded this paper.

Let Cindy know you want this paper to be uploaded.

Ask for this paper to be uploaded.