Skip redundant pieces
Home
KU Information Services
About KU Scholarworks
 
Browse
Communities
& Collections
Titles
Authors
Subjects
By Date
 
Sign on to:
Receive email
updates
My KU Scholarworks
authorized users
Edit Profile
 

Advanced Search
Subject Search

KU ScholarWorks >
School of Business >
School of Business Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1808/172
View usage statistics

Title: Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture
Authors: Shenoy, Prakash P.
Keywords: local computation
Fusion algorithm
Binary join trees
join trees
Issue Date: Aug-1997
Publisher: Elsevier Science Publishers B. V.
Extent: 343983 bytes
Type: Article
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.
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.
URI: http://hdl.handle.net/1808/172
ISSN: 0888-613X
Appears in Collections:School of Business Articles

Files in This Item:

File Description SizeFormat
IJAR97.pdf335KbAdobe PDFView/Open

Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.