arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.0691stat.MLcs.AIcs.LG
收藏

在忠诚度下学习AMP链图及其边缘模型:扩展版本

Learning AMP Chain Graphs and some Marginal Models Thereof under Faithfulness: Extended Version

Linköping University(林雪平大学)

Jose M. Peña

摘要:

本文讨论了链图在AMP解释下的性质。特别是,我们提出了一个基于约束的算法学习AMP链图给定的概率分布是忠实的。此外,我们表明,扩展米克的猜想AMP链图并不成立,这损害了发展的有效和正确的分数+搜索学习算法的假设弱于忠诚。我们还介绍了一个新的家庭的图形模型,包括无向和双向边缘。我们命名这个新的家庭最大协方差集中图(MCCGs),因为它包括协方差和浓度图作为子家庭。然而,每个MCCG都可以看作是边缘化AMP CG中的一些节点的结果。我们描述了全局,局部和成对马尔可夫性的MCCG和证明他们的等价性。我们刻画了两个MCCG是Markov等价的,并证明了MCCG的每个Markov等价类都有一个特殊的成员。我们提出了一个基于约束的算法学习MCCG给定的概率分布是忠实的。最后,我们提出了一个图形的标准阅读依赖从一个概率分布的MCCG,满足图形的性质,弱传递性和组成。我们证明了该准则在一定意义下是合理的和完备的。

英文摘要:

This paper deals with chain graphs under the Andersson-Madigan-Perlman (AMP) interpretation. In particular, we present a constraint based algorithm for learning an AMP chain graph a given probability distribution is faithful to. Moreover, we show that the extension of Meek's conjecture to AMP chain graphs does not hold, which compromises the development of efficient and correct score+search learning algorithms under assumptions weaker than faithfulness. We also introduce a new family of graphical models that consists of undirected and bidirected edges. We name this new family maximal covariance-concentration graphs (MCCGs) because it includes both covariance and concentration graphs as subfamilies. However, every MCCG can be seen as the result of marginalizing out some nodes in an AMP CG. We describe global, local and pairwise Markov properties for MCCGs and prove their equivalence. We characterize when two MCCGs are Markov equivalent, and show that every Markov equivalence class of MCCGs has a distinguished member. We present a constraint based algorithm for learning a MCCG a given probability distribution is faithful to. Finally, we present a graphical criterion for reading dependencies from a MCCG of a probability distribution that satisfies the graphoid properties, weak transitivity and composition. We prove that the criterion is sound and complete in certain sense.

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

↑