Triangulation of Bayesian networks with recursive estimation of distribution algorithms

International Journal of Approximate Reasoning

Volumn 50, Issue 3, 2009, Pages 472-484

  Romero, Txomin ^a,b   Larrañaga, Pedro ^c  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

^b DONOSTIA INTERNATIONAL PHYSICS CENTER DIPC   (Spain)

^c UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

Author keywords

Bayesian networks; Estimation of distribution algorithms; Inference; Junction tree; Triangulation

Indexed keywords

DISTRIBUTED PARAMETER NETWORKS; ESTIMATION; EVOLUTIONARY ALGORITHMS; INFERENCE ENGINES; INTELLIGENT NETWORKS; PROBABILITY DENSITY FUNCTION; PROBABILITY DISTRIBUTIONS; RECURSIVE FUNCTIONS; SPEECH ANALYSIS; SPEECH RECOGNITION; TRIANGULATION;

APPROXIMATE INFERENCES; BAYESIAN NETWORK STRUCTURES; BAYESIAN UPDATING; COMPUTATIONAL STATISTICS; ESTIMATION OF DISTRIBUTION ALGORITHMS; EVIDENCE PROPAGATION; EVOLUTIONARY COMPUTATIONS; EXACT METHODS; GRAPHICAL STRUCTURES; INFERENCE; JUNCTION TREE; LOCAL COMPUTATIONS; MORAL GRAPHS; NP-HARD PROBLEMS; OPTIMAL ORDERINGS; RECURSIVE ESTIMATIONS; TRIANGULATION TECHNIQUES; VARIABLE ORDERINGS;

BAYESIAN NETWORKS;

EID: 60849136911     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2008.09.002     Document Type: Article

References (37)

1. S. Andreassen, F.V. Jensen, S.K. Andersen, B. Falck, U. Kjærulff, M. Woldbye, A.R. Sørensen, A. Rosenfalck, F. Jensen, Munin. an emg assistant, Computer-aided surface needle electromyography, Expert Systems in Diagnosis, (1989).
2. Arnborg S., Corneil D.G., and Proskurowski A. Complexity of finding embeddings in a k-tree. SIAM Journal of Algorithms and Discrete Methods 8 (1987) 277-284
3. Arnborg S., Lagergren J., and Seese D. Easy problems for tree-decomposable graphs. Journal of Algorithms 12 2 (1991) 308-340
4. A. Becker, D. Geiger, A sufficiently fast algorithm for finding close to optimal junction trees, in: Morgan Kaufmann (Ed.), Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, 1996, pp. 81-89.
5. E. Bengoetxea, Inexact graph matching using estimation of distribution algorithms. Ph.D Thesis, Ecole Nationale Supérieure des Télécommunications, Paris, France, December 2002.
6. Bengoetxea E., Larrañaga P., Bloch I., Perchant A., and Boeres C. Learning and simulation of Bayesian networks applied to inexact graph matching. Pattern Recognition 35 12 (2002) 2867-2880
7. Blanco R., Inza I., and Larrañaga P. Learning Bayesian networks in the space of structures by estimation of distribution algorithms. International Journal of Intelligent Systems 18 (2003) 205-220
8. H. Bodlaender, A. Koster, F. van den Eijkhof, L. van der Gaag, Preprocessing for triangulation of probabilistic networks, in: Morgan Kaufmann (Ed.), Uncertainty in Artificial Intelligence (UAI-01), 2001, pp. 32-39.
9. A. Cano, S. Moral, Heuristic algorithms for the triangulation of graphs, in: Information Processing and Management of Uncertainty in Knowledge-Based Systems, París, 1994, pp. 98-107.
10. Castillo E., Gutierrez J., and Hadi A. Expert Systems and Probabilistic Network Models (1997), Springer-Verlag, New York
11. A. Darwiche, M. Hopkins. Using recursive decomposition to construct elimination orders, jointrees, and dtrees, in: ECSQARU'01: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Springer-Verlag, London, UK, 2001, pp. 180-191.
12. J.S. de Bonet, C.L. Isbell, P. Viola. MIMIC. Finding optima by estimating probability densities. in: Advances in Neural Information Processing Systems, vol. 9, 1997, pp. 424-430.
13. de Campos L.M., Gámez J.A., and Moral S. Partial abductive inference in Bayesian belief networks using a genetic algorithm. Pattern Recognition Letters 20 11-13 (1999) 1211-1217
14. Flores M.J., and Gámez J.A. Triangulation of Bayesian networks by retriangulation. International Journal of Intelligent Systems 18 2 (2003) 153-164
15. M.J. Flores, J.A. Gámez, Review on distinct methods and approaches to perform triangulation for Bayesian networks, Advances in Probabilistic Graphical Models, Studies in Fuzziness and Soft Computing, vol. 213, Springer-Verlag, 2007 (chapter A).
16. Gámez J.A., and Puerta J.M. Searching for the best elimination sequence in Bayesian networks by using ant colony based optimization. Pattern Recognition Letters 23 1-3 (2002) 261-277
17. Henrion M. Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In: Lemmer J.F., and Kanal L.N. (Eds). Uncertainty in Artificial Intelligence 2 (1988), North-Holland, Amsterdam 16-149
18. Jensen F.V. An Introduction to Bayesian Networks (1996), University College of London
19. Jensen F.V., Lauritzen S.L., and Olesen K.G. Bayesian updating in causal probablistic networks by local computations. In Computational Statistics Quaterly 4 (1990) 269-282
20. Kirpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
21. U. Kjaerulff, Triangulation of graphs - algorithms giving small total state space, Technical Report R90-09, Department of Computer Science, University of Aalborg, March 1990.
22. Kjaerulff U. Optimal decomposition of probabilistic networks by simulated annealing. Statistics and Computing 2 (1992) 7-17
23. P. Larrañaga, R. Etxeberria, J.A. Lozano, J.M. Peña, Combinatorial optimization by learning and simulation of Bayesian networks, in: Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence, 2000, pp. 343-352.
24. Larrañaga P., Kuijpers C., Poza M., and Murga R. Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms. Statistics and Computing 7 1 (1997) 19-34
25. Larrañaga P., and Lozano J.A. Estimation of distribution algorithms. A New Tool for Evolutionary Computation (2001), Kluwer Academic Publishers
26. Lauritzen S.L., and Spiegelhalter D.J. Local computations with probabilities on graphical structures and their application on expert systems. Journal of the Royal Statistical Society B 50 2 (1988) 157-224
27. J.A. Lozano, P. Larrañaga, I. Inza, E. Bengoetxea, Towards a new evolutionary computation: advances on estimation of distribution algorithms, Studies in Fuzziness and Soft Computing, vol. 192, Springer-Verlag, 2006.
28. Mühlenbein H. The equation for response to selection and its use for prediction. Evolutionary Computation 5 (1998) 303-346
29. Mühlenbein H., and Voigt H. Gene pool recombination in genetic algorithms. In: Kelly J.P., and Osman I.H. (Eds). Metaheuristics: Theory and Applications (1996), Kluwer Academic Publishers 53-62
30. Pearl J. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA
31. Peña J.M., Lozano J.A., and Larrañaga P. Unsupervised learning of Bayesian networks via estimation of distribution algorithms: an application to gene expression data clustering. In International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 12 (2004) 63-82
32. Robertson N., and Seymour P.D. Graph minors XIII the disjoint paths problem. Journal of Combinatorial Theory, Series B 63 (1995) 65-110
33. Romero T., Larrañaga P., and Sierra B. Learning Bayesian networks in the space of orderings with estimation of distribution algorithms. International Journal of Pattern Recognition and Artificial Intelligence 18 (2004) 607-625
34. Rose D.J. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. Graph Theory and Computing (1973) 183-217
35. Shachter R.S., and Kenley C.R. Gaussian influence diagrams. Management Science 35 5 (1989) 527-550
36. W.X. Wen, Optimal decomposition of belief networks, in: Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence (UAI-90), Elsevier Science Inc., New York, NY, USA, 1990, pp. 209-224.
37. S.K.M Wong, D. Wu, C.J. Butz. Triangulation of Bayesian networks: a relational database perspective, in: TSCTC'02: Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing, Springer-Verlag, London, UK, 2002, pp. 389-396.