Node deletion sequences in influence diagrams using genetic algorithms

Influence diagrams are powerful tools for representing and solving complex inference and decision-making problems under uncertainty. They are directed acyclic graphs with nodes and arcs that have a precise meaning. The algorithm for evaluating an influence diagram deletes nodes from the graph in a particular order given by the position of each node and its arcs with respect to the value node. In many cases, however, there is more than one possible node deletion sequence. They all lead to the optimal solution of the problem, but may involve different computational efforts, which is a primary issue when facing real-size models. Finding the optimal deletion sequence is a NP-hard problem. The proposals given in the literature have proven to require complex transformations of the influence diagram. In this paper, we present a genetic algorithm-based approach, which merely has to be added to the influence diagram evaluation algorithm we use, and whose codification is straightforward. The experiments, varying parameters like crossover and mutation operators, population sizes and mutation rates, are analysed statistically, showing favourable results over existing heuristics.

[1]  Ross D. Shachter,et al.  Using Potential Influence Diagrams for Probabilistic Inference and Decision Making , 1993, UAI.

[2]  Ronald A. Howard,et al.  Influence Diagrams , 2005, Decis. Anal..

[3]  Ross D. Shachter,et al.  Global Conditioning for Probabilistic Inference in Belief Networks , 1994, UAI.

[4]  Ross D. Shachter.  Evaluating Influence Diagrams , 1986, Oper. Res..

[5]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[6]  Pedro Larrañaga,et al.  Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms , 1997, Stat. Comput..

[7]  Ross D. Shachter,et al.  Dynamic programming and influence diagrams , 1990, IEEE Trans. Syst. Man Cybern..

[8]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[9]  J.T. Alander,et al.  On optimal population size of genetic algorithms , 1992, CompEuro 1992 Proceedings Computer Systems and Software Engineering.

[10]  Uffe Kjærulff.  Optimal decomposition of probabilistic networks by simulated annealing , 1992 .

[11]  Nevin Lianwen Zhang,et al.  Probabilistic Inference in Influence Diagrams , 1998, Comput. Intell..

[12]  J. R. Koehler,et al.  Modern Applied Statistics with S-Plus. , 1996 .

[13]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[14]  Concha Bielza,et al.  Structural, elicitation and computational issues faced when solving complex decision making problems with influence diagrams , 2000, Comput. Oper. Res..

[15]  Finn V. Jensen,et al.  Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

[16]  C. Kirkwood.  Strategic Decision Making , 1996 .

[17]  Lianwen Zhang.  Studies on Hypergraphs I: Hyperforests , 1993, Discret. Appl. Math..

[18]  A. C. Nicholson,et al.  Inhibition of Macrophage Scavenger Receptor Activity by Tumor Necrosis Factor- Is Transcriptionally and Post-transcriptionally Regulated (*) , 1996, The Journal of Biological Chemistry.

[19]  Samir W. Mahfoud.  Niching methods for genetic algorithms , 1996 .

[20]  Serafín Moral,et al.  Heuristic Algorithms for the Triangulation of Graphs , 1994, IPMU.

[21]  Terence C. Fogarty,et al.  Varying the Probability of Mutation in the Genetic Algorithm , 1989, ICGA.

[22]  Anders L. Madsen,et al.  Lazy Evaluation of Symmetric Bayesian Decision Problems , 1999, UAI.

[23]  Craig W. Kirkwood,et al.  Strategic decision making : multiobjective decision analysis with spreadsheets : instructor's manual , 1996 .

[24]  Dan Geiger,et al.  A Practical Algorithm for Finding Optimal Triangulations , 1997, AAAI/IAAI.

[25]  Khaled Mellouli,et al.  On the propagation of beliefs in networks using the Dempster-Shafer theory of evidence , 1987 .

[26]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[27]  J. Hsu.  Multiple Comparisons: Theory and Methods , 1996 .

[28]  Ross D. Shachter,et al.  Directed reduction algorithms and decomposable graphs , 1990, UAI.

[29]  Robert T. Clemen,et al.  Making Hard Decisions: An Introduction to Decision Analysis , 1997 .

[30]  Eyal Amir,et al.  Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.

[31]  Concha Bielza,et al.  A Comparison of Graphical Techniques for Asymmetric Decision Problems , 1999 .

[32]  Zbigniew Michalewicz,et al.  Genetic Algorithms Plus Data Structures Equals Evolution Programs , 1994 .

[33]  Frank Jensen,et al.  From Influence Diagrams to junction Trees , 1994, UAI.

[34]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[35]  Prakash P. Shenoy,et al.  Valuation-Based Systems for Bayesian Decision Analysis , 1992, Oper. Res..

[36]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[37]  Gregory F. Cooper,et al.  A Method for Using Belief Networks as Influence Diagrams , 2013, UAI 1988.

[38]  Max Henrion,et al.  Some Practical Issues in Constructing Belief Networks , 1987, UAI.

[39]  Pedro Larrañaga,et al.  Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators , 1999, Artificial Intelligence Review.

[40]  Ek Peng Chew,et al.  Variable period adaptive genetic algorithm , 2002 .

[41]  Thomas D. Nielsen,et al.  Welldefined Decision Scenarios , 1999, UAI.