Maximum likelihood fitting of acyclic directed mixed graphs to binary data

Add code
Mar 15, 2012
Robin J. Evans, Thomas S. Richardson
Figure 1 for Maximum likelihood fitting of acyclic directed mixed graphs to binary data
Figure 2 for Maximum likelihood fitting of acyclic directed mixed graphs to binary data
Figure 3 for Maximum likelihood fitting of acyclic directed mixed graphs to binary data
Figure 4 for Maximum likelihood fitting of acyclic directed mixed graphs to binary data

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

Acyclic directed mixed graphs, also known as semi-Markov models represent the conditional independence structure induced on an observed margin by a DAG model with latent variables. In this paper we present the first method for fitting these models to binary data using maximum likelihood estimation.

* Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon