Preprocessing rules for triangulation of probabilistic networks

Computational Intelligence

Volumn 21, Issue 3, 2005, Pages 286-305

  Bodlaender, Hans L ^a   Koster, Arie M C A ^b   Van Den Eijkhof, Frank ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

^b ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Inference; Preprocessing; Probabilistic networks; Treewidth; Triangulation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SCIENCE; GRAPH THEORY; INFORMATION TECHNOLOGY; TRIANGULATION;

INFERENCE; PREPROCESSING; PROBABILISTIC NETWORKS; TREEWIDTH;

PROBABILISTIC LOGICS;

EID: 27644593461     PISSN: 08247935     EISSN: 14678640     Source Type: Journal    
DOI: 10.1111/j.1467-8640.2005.00274.x     Document Type: Article

References (21)

1. AMIR, E. 2001. Efficient approximations for triangulation of minimum treewidth. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, pp. 7-15, Morgan Kaufman, Seattle, Washington, USA.
2. ARNBORG, S., D. G. CORNEIL, and A. PROSKUROWSKI. 1987. Complexity of finding embeddings in a k-tree. SIAM Journal in Algebraic and Discrete Methods, 8:277-284.
3. ARNBORG, S., B. COURCELLE, A. PROSKUROWSKI, and D. SEESE. 1993. An algebraic theory of graph reduction. Journal of the ACM, 40:1134-1164.
4. ARNBORG, S., and A. PROSKUROWSKI. 1986. Characterization and recognition of partial 3-trees. SIAM Journal on Algebraic and Discrete Methods, 7:305-314.
5. BODLAENDER, H. L. 1993. A tourist guide through treewidth. Acta Cybernetica, 11:1-23.
6. BODLAENDER, H. L. 1998. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1-45.
7. BODLAENDER, H. L., and A. M. C. A. KOSTER. 2004. Safe separators for treewidth. In Proceedings Sixth Workshop on Algorithm Engineering and Experiments ALENEX04, pp. 70-78.
8. CORMEN, T. H., C. E. LEISERSON, R. L. RIVEST, and C. STEIN. 2001. Introduction to Algorithms. MIT Press: Cambridge, Massachusette.
9. EIJKHOF, F. V. D., and H. L. BODLAENDER. 2002. Safe reduction rules for weighted treewidth. In Proceedings 28th Int. Workshop on Graph Theoretic Concepts in Computer Science, WG'02. Edited by L. Kučera, pp. 176-185. Springer Verlag, Lecture Notes in Computer Science, vol. 2573.
10. GOGATE, V., and R. DECHTER. 2004. A complete anytime algorithm for treewidth. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, 2004. Arlington, Virginia, USA, pp. 201-208, AUAI Press.
11. GOLUMBIC, M. C. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
12. JENSEN, F., S. LAURITZEN, and K. OLESEN. 1990. Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly, 4:269-282.
13. KJÆRULFF, U. 1993. Aspects of Efficiency Improvement in Bayesian Networks. Ph.D. Thesis, Aalborg University, Aalborg, Denmark.
14. KOSTER, A. M. C. A., H. L. BODLAENDER, and S. P. M. VANHOESEL. 2001. Treewidth: Computational experiments. In Electronic Notes in Discrete Mathematics. Edited by H. Broersma, U. Faigle, J. Hurink, and S. Pickl, volume 8. Elsevier Science Publishers, Amsterdam, The Netherlands, pp. 54-57.
15. LAGERGREN, J. 1994. The nonexistence of reduction rules giving an embedding into a k-tree. Discrete Applied Mathematics, 54:219-223.
16. LAURITZEN, S. J., and D. J. SPIEGELHALTER. 1988. Local computations with probabilities on graphical structures and their application to expert systems. The Journal of the Royal Statistical Society. Series B (Methodological), 50:157-224.
17. MATOUŠEK, J., and R. THOMAS. 1991. Algorithms for finding tree-decompositions of graphs. Journal of Algorithms, 12:1-22.
18. OLESEN, K. G., and A. L. MADSEN. 2002. Maximal prime subgraph decomposition of Bayesian Networks. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 32:21-31.
19. SANDERS, D. P. 1996. On linear recognition of tree-width at most four. SIAM Journal of Discrete Mathematics, 9(1):101-117.
20. SHOIKHET, K., and D. GEIGER. 1997. A practical algorithm for finding optimal triangulations. In Proceedings National Conference on Artificial Intelligence (AAAI '97), pp. 185-190. Morgan Kaufmann, Providence, Rhode Island, USA.
21. TREEWIDTHLIB. 2004. Available at http://www.cs.uu.nl/people/hansb/ treewidthlib, 2004-03-31.