2015
DOI: 10.1111/sjos.12194
|View full text |Cite
|
Sign up to set email alerts
|

Graphs for Margins of Bayesian Networks

Abstract: Directed acyclic graph (DAG) models, also called Bayesian networks, impose conditional independence constraints on a multivariate probability distribution, and are widely used in probabilistic reasoning, machine learning and causal inference. If latent variables are included in such a model, then the set of possible marginal distributions over the remaining (observed) variables is generally complex, and not represented by any DAG. Larger classes of mixed graphical models, which use multiple edge types, have be… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
71
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 59 publications
(73 citation statements)
references
References 33 publications
2
71
0
Order By: Relevance
“…As shown by Evans (see proposition 4.9(b) and theorem 4.13 in [17]), every GDAG is observationally equivalent to its canonical projection, in the sense that they have the same set of possible marginal distributions P (V ) on the observed variables.…”
Section: Definition 3: Hidden Paths and Causes Let X Ymentioning
confidence: 90%
See 4 more Smart Citations
“…As shown by Evans (see proposition 4.9(b) and theorem 4.13 in [17]), every GDAG is observationally equivalent to its canonical projection, in the sense that they have the same set of possible marginal distributions P (V ) on the observed variables.…”
Section: Definition 3: Hidden Paths and Causes Let X Ymentioning
confidence: 90%
“…We begin with some useful definitions adapted from [16,17]. Where our terminology differs from that of Evans, a translation is provided in the footnotes.…”
Section: The Skeleton Methods and E-separationmentioning
confidence: 99%
See 3 more Smart Citations