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

学习LWF链图:一种马尔可夫毯发现方法

Learning LWF Chain Graphs: A Markov Blanket Discovery Approach

University of South Carolina(南卡罗来纳大学)

Mohammad Ali Javidian, Marco Valtorta, Pooyan Jamshidi

摘要:

本文给出了链图(CG)中Markov毯在LWF解释下的一个图形刻画。我们提供了一个新的可扩展的和健全的算法在LWF CG的马尔可夫毯发现,并证明了增长收缩算法,IAMB算法,和它的变种仍然是正确的马尔可夫毯发现在LWF CG的贝叶斯网络相同的假设下。我们提供了一个健全的和可扩展的约束为基础的框架,学习结构的LWF CG从忠实的因果充分的数据,并证明其正确性时,本文中使用的马尔可夫毯发现算法。我们提出的算法比较积极/竞争力对国家的最先进的LCD(通过分解学习链图)算法,这取决于用于马尔可夫毯发现的算法。我们提出的算法使广泛的推理/学习问题计算上易于处理,更可靠,因为它们利用局部性。

英文摘要:

This paper provides a graphical characterization of Markov blankets in chain graphs (CGs) under the Lauritzen-Wermuth-Frydenberg (LWF) interpretation. The characterization is different from the well-known one for Bayesian networks and generalizes it. We provide a novel scalable and sound algorithm for Markov blanket discovery in LWF CGs and prove that the Grow-Shrink algorithm, the IAMB algorithm, and its variants are still correct for Markov blanket discovery in LWF CGs under the same assumptions as for Bayesian networks. We provide a sound and scalable constraint-based framework for learning the structure of LWF CGs from faithful causally sufficient data and prove its correctness when the Markov blanket discovery algorithms in this paper are used. Our proposed algorithms compare positively/competitively against the state-of-the-art LCD (Learn Chain graphs via Decomposition) algorithm, depending on the algorithm that is used for Markov blanket discovery. Our proposed algorithms make a broad range of inference/learning problems computationally tractable and more reliable because they exploit locality.

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

↑