A Review on Distinct Methods and Approaches to Perform Triangulation for Bayesian Networks
暂无分享,去创建一个
[1] José A. Gámez,et al. Triangulation of Bayesian networks by retriangulation , 2003, Int. J. Intell. Syst..
[2] Uffe Kjærulff. Optimal decomposition of probabilistic networks by simulated annealing , 1992 .
[3] Pedro Larrañaga,et al. Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms , 1997, Stat. Comput..
[4] Dan Geiger,et al. A Practical Algorithm for Finding Optimal Triangulations , 1997, AAAI/IAAI.
[5] Barry W. Peyton,et al. Minimal Orderings Revisited , 1999, SIAM J. Matrix Anal. Appl..
[6] Frank Jensen,et al. Optimal junction Trees , 1994, UAI.
[7] Robert E. Tarjan,et al. Network Flow and Testing Graph Connectivity , 1975, SIAM J. Comput..
[8] Robert E. Tarjan,et al. Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..
[9] Mark Hopkins,et al. Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees , 2001, ECSQARU.
[10] Anders L. Madsen,et al. LAZY Propagation: A Junction Tree Inference Algorithm Based on Lazy Evaluation , 1999, Artif. Intell..
[11] Michael de la Maza,et al. Book review: Genetic Algorithms + Data Structures = Evolution Programs by Zbigniew Michalewicz (Springer-Verlag, 1992) , 1993 .
[12] T. Speed,et al. Decomposable graphs and hypergraphs , 1984, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.
[13] Lawrence Davis,et al. Genetic Algorithms and Simulated Annealing , 1987 .
[14] Steffen L. Lauritzen,et al. Bayesian updating in causal probabilistic networks by local computations , 1990 .
[15] Ludek Kucera,et al. Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science , 2002 .
[16] David J. Spiegelhalter,et al. Local computations with probabilities on graphical structures and their application to expert systems , 1990 .
[17] Roman Barták,et al. Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.
[18] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[19] Vibhav Gogate,et al. A Complete Anytime Algorithm for Treewidth , 2004, UAI.
[20] María Julia Flores Gallego. Bayesian networks inference advanced algorithms for triangulation abd partical abduction , 2005 .
[21] Linda C. van der Gaag,et al. Pre-processing for Triangulation of Probabilistic Networks , 2001, UAI.
[22] Serafín Moral,et al. Penniless propagation in join trees , 2000 .
[23] Kristian G. Olesen,et al. Maximal Prime Subgraph Decomposition of Bayesian Networks , 2001, FLAIRS.
[24] Hanns-Georg Leimer,et al. Optimal decomposition by clique separators , 1993, Discret. Math..
[25] Robert E. Tarjan,et al. Decomposition by clique separators , 1985, Discret. Math..
[26] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[27] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[28] Pinar Heggernes,et al. Maximum Cardinality Search for Computing Minimal Triangulations , 2002, WG.
[29] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[30] Wilson X. Wen,et al. Optimal decomposition of belief networks , 1990, UAI.
[31] S. Moral,et al. On the problem of performing exact partial abductive inference in Bayesian belief networks using junction trees , 2002 .
[32] Jose Miguel Puerta,et al. Searching for the best elimination sequence in Bayesian networks by using ant colony optimization , 2002, Pattern Recognit. Lett..
[33] Eyal Amir,et al. Efficient Approximation for Triangulation of Minimum Treewidth , 2001, UAI.
[34] D. Rose. A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .
[35] Adnan Darwiche,et al. Solving MAP Exactly using Systematic Search , 2002, UAI.
[36] Serafín Moral,et al. Heuristic Algorithms for the Triangulation of Graphs , 1994, IPMU.
[37] Pinar Heggernes,et al. A practical algorithm for making filled graphs minimal , 2001, Theor. Comput. Sci..
[38] José A. Gámez,et al. Incremental compilation of Bayesian networks , 2002, UAI.
[39] Yngve Villanger. Lex M versus MCS-M , 2006, Discret. Math..
[40] Prakash P. Shenoy,et al. Axioms for probability and belief-function proagation , 1990, UAI.
[41] Manuel López-Ibáñez,et al. Ant colony optimization , 2010, GECCO '10.
[42] Dan Geiger,et al. A sufficiently fast algorithm for finding close to optimal junction trees , 1996, UAI.
[43] Serafín Moral,et al. Lazy evaluation in penniless propagation over join trees , 2002, Networks.
[44] Pinar Heggernes,et al. A wide-range algorithm for minimal triangulation from an arbitrary ordering , 2006, J. Algorithms.
[45] Bernadette Bouchon-Meunier,et al. Advances in intelligent computing--IPMU '94 : 5th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Paris, France, July 4-8, 1994 : selected papers , 1995 .
[46] Pinar Heggernes,et al. Efficient Implementation of a Minimal Triangulation Algorithm , 2002, ESA.
[47] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[48] Barry W. Peyton,et al. Maximum Cardinality Search for Computing Minimal Triangulations of Graphs , 2004, Algorithmica.
[49] G. Karypis,et al. Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization , 2003, ICCAD-2003. International Conference on Computer Aided Design (IEEE Cat. No.03CH37486).