ATTENTION: The software behind KU ScholarWorks is being upgraded to a new version. Starting July 15th, users will not be able to log in to the system, add items, nor make any changes until the new version is in place at the end of July. Searching for articles and opening files will continue to work while the system is being updated. If you have any questions, please contact Marianne Reed at mreed@ku.edu .

Show simple item record

Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture

dc.contributor.authorShenoy, Prakash P.
dc.date.accessioned2004-12-18T23:58:01Z
dc.date.available2004-12-18T23:58:01Z
dc.date.issued1997-08
dc.identifier.citationShenoy, 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.
dc.identifier.issn0888-613X
dc.identifier.urihttp://hdl.handle.net/1808/172
dc.description.abstractThe 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.
dc.format.extent343983 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherElsevier Science Publishers B. V.
dc.subjectLocal computation
dc.subjectFusion algorithm
dc.subjectBinary join trees
dc.subjectJoin trees
dc.titleBinary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture
dc.typeArticle
dc.identifier.orcidhttps://orcid.org/0000-0002-8425-896X
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail
Name:
IJAR97.pdf
Size:
335.9Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record