LOGICAL AND ALGORITHMIC PROPERTIES OF CONDITIONAL-INDEPENDENCE AND GRAPHICAL MODELS
成果类型：
Article
署名作者：
GEIGER, D; PEARL, J
署名单位：
University of California System; University of California Los Angeles
刊物名称：
ANNALS OF STATISTICS
ISSN/ISSBN：
0090-5364
DOI：
10.1214/aos/1176349407
发表日期：
1993
页码：
2001-2021
关键词：
摘要：
This article develops an axiomatic basis for the relationship between conditional independence and graphical models in statistical analysis. In particular, the following relationships are established: (1) every axiom for conditional independence is an axiom for graph separation, (2) every graph represents a consistent set of independence and dependence constraints, (3) all binary factorizations of strictly positive probability models can be encoded and determined in polynomial time using their correspondence to graph separation, (4) binary factorizations of non-strictly positive probability models can also be derived in polynomial time albeit less efficiently and (5) unconditional independence relative to normal models can be axiomatized with a finite set of axioms.