The computation of first order moments on junction trees

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. K, where A,B U. We assume that the following Shafer-Shenoy axioms hold for combination and marginalization. We omit the parentheses from the notation when it is not prone to misunderstanding.