Triangulation of Bayesian Networks Using an Adaptive Genetic Algorithm
暂无分享,去创建一个
[1] 大西 仁,et al. Pearl, J. (1988, second printing 1991). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann. , 1994 .
[2] Wilson X. Wen,et al. Optimal decomposition of belief networks , 1990, UAI.
[3] Pedro Larrañaga,et al. Decomposing Bayesian networks: triangulation of the moral graph with genetic algorithms , 1997, Stat. Comput..
[4] Michael I. Jordan,et al. Thin Junction Trees , 2001, NIPS.
[5] Henri Luchian,et al. Integrated-Adaptive Genetic Algorithms , 2003, ECAL.
[6] 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..
[7] Gary G. Yen,et al. A generic framework for constrained optimization using genetic algorithms , 2005, IEEE Transactions on Evolutionary Computation.
[8] Uffe Kjærulff. Optimal decomposition of probabilistic networks by simulated annealing , 1992 .
[9] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[10] Thomas Bäck,et al. Theory of Genetic Algorithms , 2001, Current Trends in Theoretical Computer Science.
[11] Lothar Thiele,et al. A Comparison of Selection Schemes used in Genetic Algorithms , 1995 .
[12] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[13] Uue Kjjrull. Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .
[14] Michael Luby,et al. Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..