Binary Join Trees

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.

• Type: Conference
• Year: 1996
• Where: UAI
• Authors: Prakash P. Shenoy
• Keywords: Binary Join Trees, Main Goal, Multiple Marginals, UAI 1996, UAI 2008