A Transformational Characterization of Markov Equivalence for Directed Acyclic Graphs with Latent Variables
暂无分享,去创建一个
[1] Judea Pearl,et al. Equivalence and Synthesis of Causal Models , 1990, UAI.
[2] David Maxwell Chickering,et al. Optimal Structure Identification With Greedy Search , 2002, J. Mach. Learn. Res..
[3] D. Madigan,et al. A characterization of Markov equivalence classes for acyclic digraphs , 1997 .
[4] P. Spirtes,et al. Ancestral graph Markov models , 2002 .
[5] Peter Spirtes,et al. A Characterization of Markov Equivalence Classes for Ancestral Graphical Models , 2005 .
[6] T. Richardson,et al. Graphical Answers to Questions about Likelihood Inference for Gaussian Covariance Models , 2004 .
[7] P. Spirtes,et al. A Polynomial Time Algorithm for Determining DAG Equivalence in the Presence of Latent Variables and Selection Bias , 1997, AISTATS.
[8] Thomas S. Richardson,et al. Towards Characterizing Markov Equivalence Classes for Directed Acyclic Graphs with Latent Variables , 2005, UAI.
[9] Thomas S. Richardson,et al. Heuristic Greedy Search Algorithms for Latent Variable Models , 1997, AISTATS.
[10] C. Meek,et al. Graphical models: selecting causal and statistical models , 1997 .
[11] David Maxwell Chickering,et al. A Transformational Characterization of Equivalent Bayesian Network Structures , 1995, UAI.