The computation of first order moments on junction trees

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, 1 figure

Scientific paper

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\'a 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The computation of first order moments on junction trees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The computation of first order moments on junction trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The computation of first order moments on junction trees will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-96585

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.