从链图的观点看贝叶斯网络
Bayesian Networks from the Point of View of Chain Graphs
摘要:
本文给出了几个论据,赞成使用链图描述概率条件独立结构。每一个贝叶斯网络模型都可以通过一个关于链图的因子分解公式等价地引入,该链图与贝叶斯网络是马尔可夫等价的。给出了这类图的一个图形特征.这类等价图可以用一个称为最大链图的特殊图来表示。关于最大链图的因式分解公式是如何在计算机中表示相应(离散)概率分布(即参数化)的建议的基础。这种方法不依赖于从等价网络类中选择特定的贝叶斯网络,并且从内存需求的角度来看似乎是最有效的方法。给出了从链图中读取独立性语句的分离准则。它类似于众所周知的贝叶斯网络的d-分离准则,可以在本地实现。
英文摘要:
AThe paper gives a few arguments in favour of the use of chain graphs for description of probabilistic conditional independence structures. Every Bayesian network model can be equivalently introduced by means of a factorization formula with respect to a chain graph which is Markov equivalent to the Bayesian network. A graphical characterization of such graphs is given. The class of equivalent graphs can be represented by a distinguished graph which is called the largest chain graph. The factorization formula with respect to the largest chain graph is a basis of a proposal of how to represent the corresponding (discrete) probability distribution in a computer (i.e. parametrize it). This way does not depend on the choice of a particular Bayesian network from the class of equivalent networks and seems to be the most efficient way from the point of view of memory demands. A separation criterion for reading independency statements from a chain graph is formulated in a simpler way. It resembles the well-known d-separation criterion for Bayesian networks and can be implemented locally.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。