连接树上一阶矩的计算
The computation of first order moments on junction trees
摘要:
我们回顾了一些现有的方法计算一阶矩的连接树使用Shafer-Shenoy算法。首先,我们将一阶矩的计算问题看作是连接树中的顶点问题。通过这种方式,利用连接树边集基数的阶的存储空间来解决问题。在此之后,我们考虑了两个算法,Lauritzen-Nilsson算法,和Mauá等人。算法,它计算一阶矩作为连接树的规范化问题,使用连接树叶集基数的一个顺序的存储空间。
英文摘要:
We review some existing methods for the computation of first order moments on junction trees using Shafer-Shenoy algorithm. First, we consider the problem of first order moments computation as vertices problem in junction trees. In this way, the problem is solved using the memory space of an order of the junction tree edge-set cardinality. After that, we consider two algorithms, Lauritzen-Nilsson algorithm, and Mauá et al. algorithm, which computes the first order moments as the normalization problem in junction tree, using the memory space of an order of the junction tree leaf-set cardinality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。