聖塔非研究所

摘要 A directed acyclic graph (DAG) partially represen

2015-04-16 · 已發表論文 · 更新 2026/08/30 下午12:48

摘要 A directed acyclic graph (DAG) partially represents the conditional independence structure among observations of a system if the local 馬可夫 condition holds, that is if every variable is in…

本頁只刊出中文翻譯與中文說明;英文原文請見下方原文連結。

原文連結

論文資訊

  • 類型:已發表論文
  • 日期:2015-04-16

摘要

A directed acyclic graph (DAG) partially represents the conditional independence structure among observations of a system if the local 馬可夫 condition holds, that is if every variable is independent of its non-descendants given its parents. In general, there is a whole class of DAGs that represents a given set of conditional independence relations. We are interested in properties of this class that can be derived from observations of a subsystem only. To this end, we prove an 資訊-theoretic 不平等 that allows for the inference of common ancestors of observed parts in any DAG representing some unknown larger system. More explicitly, we show that a large amount of dependence in terms of mutual 資訊 among the observations implies the existence of a common ancestor that distributes this 資訊. Within the

※ 此為已發表論文,全文需透過期刊付費取得