Maximum likelihood fitting of acyclic directed mixed graphs to binary data

2012/03/15 by Evans, Robin J., Richardson, Thomas S.
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Methodology (stat.ME)

paper · doi:10.48550/arxiv.1203.3479

Abstract

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.

Related

• A factorization criterion for acyclic directed mixed graphs
• Parameter and Structure Learning in Nested Markov Models
• High dimensional Bayesian inference for Gaussian directed acyclic graph\n models
• Parameterizations and fitting of bi-directed graph models to categorical data
• A New Algorithm for Maximum Likelihood Estimation in Gaussian Graphical\n Models for Marginal Independence