Loading...
Binary Join Trees
Shenoy, Prakash P.
Shenoy, Prakash P.
Citations
Altmetric:
Abstract
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>.
Date
1996
Journal Title
Journal ISSN
Volume Title
Publisher
Morgan Kaufmann Publishers
Research Projects
Organizational Units
Journal Issue
Keywords
Computing marginals, Shenoy-Shafer architecture, Join trees
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.