arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1304.2379cs.AI
收藏

因果网络:语义与表达

Causal Networks: Semantics and Expressiveness

University of California Los Angeles(加州大学洛杉矶分校)

Tom S. Verma, Judea Pearl

摘要:

依赖性知识的形式“x是独立的y一旦z是已知的”总是服从四个图形公理,例子包括概率和数据库的依赖性。通常,这样的知识可以有效地表示与图形结构,如无向图和有向无环图(DAG)。在本文中,我们表明,称为d-分离的图形标准是一个健全的规则,从任何DAG的因果输入列表从一个graphoid的基础上读取独立性。该规则可以被扩展以覆盖表示函数依赖性以及条件依赖性的DAG。

英文摘要:

Dependency knowledge of the form "x is independent of y once z is known" invariably obeys the four graphoid axioms, examples include probabilistic and database dependencies. Often, such knowledge can be represented efficiently with graphical structures such as undirected graphs and directed acyclic graphs (DAGs). In this paper we show that the graphical criterion called d-separation is a sound rule for reading independencies from any DAG based on a causal input list drawn from a graphoid. The rule may be extended to cover DAGs that represent functional dependencies as well as conditional dependencies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑