A Transformational Characterization of Equivalent Bayesian Network Structures
暂无分享,去创建一个
[1] Wai Lam,et al. Using Causal Information and Local Measures to Learn Bayesian Networks , 1993, UAI.
[2] M. Tarsi,et al. A simple algorithm to construct a consistent extension of a partially oriented graph , 1992 .
[3] P. Spirtes,et al. Causation, prediction, and search , 1993 .
[4] Judea Pearl,et al. An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation , 1992, UAI.
[5] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[6] H. Akaike. A new look at the statistical model identification , 1974 .
[7] J. Q. Smith. Influence Diagrams for Statistical Modelling , 1989 .
[8] D. Madigan,et al. A characterization of Markov equivalence classes for acyclic digraphs , 1997 .
[9] Judea Pearl,et al. A Theory of Inferred Causation , 1991, KR.
[10] G. Schwarz. Estimating the Dimension of a Model , 1978 .
[11] David Madigan,et al. A Note on Equivalence Classes of Directed Acyclic Independence Graphs , 1993, Probability in the Engineering and Informational Sciences.
[12] Christopher Meek,et al. Causal inference and causal explanation with background knowledge , 1995, UAI.
[13] J. Rissanen. Stochastic Complexity and Modeling , 1986 .
[14] Remco R. Bouckaert,et al. Probalistic Network Construction Using the Minimum Description Length Principle , 1993, ECSQARU.
[15] Judea Pearl,et al. Equivalence and Synthesis of Causal Models , 1990, UAI.
[16] David Heckerman,et al. Learning Bayesian Networks: Search Methods and Experimental Results , 1995 .