arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.4504stat.MLcs.AImath.STstat.TH
收藏

从协方差图中读取相关性

Reading Dependencies from Covariance Graphs

Linköping University(林雪平大学)

Jose M. Peña

摘要:

概率分布$p$的协方差图(也称为双向图)是无向图$G$,其中两个节点相邻当且仅当它们对应的随机变量在$p$中略微相关。本文在假设$p$满足图的性质以及弱传递性和组合性的前提下,给出了从$p$中读取依赖关系的一个图判据.我们证明了该图判据在一定意义下是合理的和完备的。我们认为,我们的假设并没有太多的限制。例如,所有正则高斯概率分布都满足它们。

英文摘要:

The covariance graph (aka bi-directed graph) of a probability distribution $p$ is the undirected graph $G$ where two nodes are adjacent iff their corresponding random variables are marginally dependent in $p$. In this paper, we present a graphical criterion for reading dependencies from $G$, under the assumption that $p$ satisfies the graphoid properties as well as weak transitivity and composition. We prove that the graphical criterion is sound and complete in certain sense. We argue that our assumptions are not too restrictive. For instance, all the regular Gaussian probability distributions satisfy them.

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

↑