Abstract
The problem of triangulation (decomposition) of Bayesian networks is considered. Triangularity of a Bayesian network is required in a general evidence propagation scheme on this network. Finding an optimal triangulation is NP-hard. A local search heuristic based on the idea of evolutionary algorithms is presented. The results obtained using existing and proposed approaches are compared on a basis of a computational experiment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersen SK, Jensen FV, Olesen KG (1990) An algebra of Bayesian Belief Universes for Knowledge-Based Systems.Networks 20: 637-659
Jensen FV, Jensen F (1994) Optimal Junction Trees. Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers, San Francisco, pp 360-366
Kjeerulff U (1990) Triangulation of Graphs - Algorithms Giving Small Total State Space. Research Report R90-09, Department of Computer Science, Aalborg University, Denmark
Larranaga P, Kuijpers C, Poza M, Murga R (1997) Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms. Statistics and Computing 7: 19-34
Lauritzen SL, SpiegelhalterDJ (1988) Local computationswith probabilities on graphical structure and their application to expert systems (with discussion). Journal of Royal Statistical Society, SeriesB 50: 157-224
Lukaszewski T (2001) Knowledge Updating in Bayesian Networks. Procedings of the 14th International Conference on Systems Science, Oficyna Wydawnicza Politechniki Wroclawskiej,Wroclaw,pp 274-281
Shenoy P, Shafer G (1990) Axioms for probability and belief-function propagation. In Shachter RD, Levitt TS, Lemmer JF, Kanal LN (008) Uncertainty in Artificial Intelligence 4: 169-198
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Łukaszewski, T. (2003). An Evolutionary Algorithm for Bayesian Network Triangulation. In: Leopold-Wildburger, U., Rendl, F., Wäscher, G. (eds) Operations Research Proceedings 2002. Operations Research Proceedings 2002, vol 2002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55537-4_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-55537-4_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00387-8
Online ISBN: 978-3-642-55537-4
eBook Packages: Springer Book Archive