Binary Join Trees

Add code
Feb 13, 2013
Prakash P. Shenoy
Figure 1 for Binary Join Trees
Figure 2 for Binary Join Trees
Figure 3 for Binary Join Trees
Figure 4 for Binary Join Trees

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently using the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and sketch a procedure for constructing them.

* Appears in Proceedings of the Twelfth Conference on Uncertainty in Artificial Intelligence (UAI1996)  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon