Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture
Abstract
The main goal of this paper is to describe a data structure called binary join trees that are useful in computing multiple marginals efficiently in the Shenoy-Shafer architecture. We define binary join trees, describe their utility, and describe a procedure for constructing them.
ISSN
0888-613XCollections
Citation
Shenoy, P. P., "Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture," International Journal of Approximate Reasoning, Vol. 17, Nos 2--3, 1997, pp. 239--263.
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
