从多叉树贝叶斯网络中读取相关性
Reading Dependencies from Polytree-Like Bayesian Networks
摘要:
当G是一棵多叉树且p满足复合性和弱传递性时,我们给出了一个从图型p的最小有向独立映射G中读取依赖关系的图形准则。我们证明了该准则是合理的和完备的。我们认为,假设合成和弱传递性是不是太严格。
英文摘要:
We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictive.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。