Supplement to "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs"
暂无分享,去创建一个
This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs".
[1] Bin Yu,et al. Reversible MCMC on Markov equivalence classes of sparse directed acyclic graphs , 2012, ArXiv.
[2] David Maxwell Chickering,et al. A Transformational Characterization of Equivalent Bayesian Network Structures , 1995, UAI.
[3] M. Tarsi,et al. A simple algorithm to construct a consistent extension of a partially oriented graph , 1992 .
[4] David Maxwell Chickering,et al. Learning Equivalence Classes of Bayesian Network Structures , 1996, UAI.