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/178
View usage statistics

Title: Binary Join Trees
Authors: Shenoy, Prakash P.
Keywords: Computing marginals
Shenoy-Shafer architecture
Join trees
Issue Date: 1996
Publisher: Morgan Kaufmann Publishers
Extent: 173941 bytes
Type: Book chapter
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.
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>.
URI: http://hdl.handle.net/1808/178
ISBN: 1-55860-412-X
Appears in Collections:School of Business Articles

Files in This Item:

File Description SizeFormat
UAI96.pdf169KbAdobe PDFView/Open

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