A factorization criterion for acyclic directed mixed graphs

Authors:
Thomas S. Richardson
Affiliations:
University of Washington
Venue:
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Year:
2009

Citing 4
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Local computation with valuations from a commutative semigroup

Annals of Mathematics and Artificial Intelligence
Causal Graphical Models with Latent Variables: Learning and Inference

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Computing Maximum Likelihood Estimates in Recursive Linear Models with Correlated Errors

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.00

Visualization

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 a factorization criterion for these models that is equivalent to the global Markov property given by (the natural extension of) dseparation.