Given a BN whose graph is a tree and whose nodes are all binary, which is the most efficient algorithm to compute the Most Probable Explanation, i.e. the assignment to all nodes associated with the maximum probability? Is there any "R" package implementing appropriate algorithms?

asked 17 Mar '12, 04:40

stellafabio's gravatar image


Be the first one to answer this question!
toggle preview

Follow this Question via Email

Once you sign in you will be able to subscribe for any updates here

Q&A Editor Basics

  • to upload an image into your question or answer hit
  • to create bulleted or numbered lists hit or
  • to add a title or header hit
  • to section your text hit
  • to make a link clickable, surround it with <a> and </a> (for example, <a></a>)
  • basic HTML tags are also supported (for those who know a bit of HTML)
  • To insert an EQUATION you can use LaTeX. (backslash \ has to be escaped, so in your LaTeX code you have to replace \ with \\). You can see more examples and info here

powered by OSQA