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

dc.contributor.advisorhttp://orcid.org/0000-0002-8425-896X
dc.contributor.authorShenoy, Prakash P.
dc.date.accessioned2004-12-20T15:10:14Z
dc.date.available2004-12-20T15:10:14Z
dc.date.issued1996
dc.identifier.citationShenoy, 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.
dc.identifier.isbn1-55860-412-X
dc.identifier.urihttp://hdl.handle.net/1808/178
dc.descriptionA 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>.
dc.description.abstractThe 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.
dc.format.extent173941 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherMorgan Kaufmann Publishers
dc.subjectComputing marginals
dc.subjectShenoy-Shafer architecture
dc.subjectJoin trees
dc.titleBinary Join Trees
dc.typeBook chapter
kusw.oastatusna
dc.identifier.orcidhttps://orcid.org/0000-0002-8425-896X
kusw.oapolicyThis item does not meet KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record