Binary Join Trees

View/ Open
Issue Date
1996Author
Shenoy, Prakash P.
Publisher
Morgan Kaufmann Publishers
Format
173941 bytes
Type
Book chapter
Metadata
Show full item recordAbstract
The main goal of this paper is to describe a datastructure called binary join trees that are useful incomputing multiple marginals efficiently usingthe Shenoy-Shafer architecture. We define binaryjoin trees, describe their utility, and sketch a procedure for constructing them.
Description
A longer and updated version of this paper appears in: Shenoy, P. P., "Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture," International Journal of Approximate Reasoning, 17(2--3), 1997, 239--263 (available from <http://hdl.handle.net/1808/172>.
ISBN
1-55860-412-XCollections
Citation
Shenoy, P. P., "Binary Join Trees," in E. Horvitz and F. V. Jensen (eds.), Uncertainty in Artificial Intelligence, Vol. 12, 1996, pp. 492--499, Morgan Kaufmann, San Francisco, CA.
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.