.png){kind=icon}
返回
UNIFYING MARKOV PROPERTIES FOR GRAPHICAL MODELS
.png){kind=icon}
OA
AI
DOI：10.1214/17-AOS1618.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Several types of graphs with different conditional independence interpretations-also known as Markov properties-have been proposed and used in graphical models. In this paper, we unify these Markov properties by introducing a class of graphs with four types of edges-lines, arrows, arcs and dotted lines-and a single separation criterion. We show that independence structures defined by this class specialize to each of the previously defined cases, when suitable subclasses of graphs are considered. In addition, we define a pairwise Markov property for the subclass of chain mixed graphs, which includes chain graphs with the LWF interpretation, as well as summary graphs (and consequently ancestral graphs). We prove the equivalence of this pairwise Markov property to the global Markov property for compositional graphoid independence models.
Keyword:
AMP Markov property
c-separation
chain graph
compositional graphoid
d-separation
independence model
LWF Markov property
m-separation
mixed graph
pairwise Markov property
regression chain Markov property
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
.png){kind=icon}
分享收藏
Ferroelectric Properties of a KNO3 Single Crystal Application to the Detection of Thermal Radiation
PREAI
分享收藏
查看更多内容