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

Shenoy, Prakash P.

dc.contributor.author	Shenoy, Prakash P.
dc.date.accessioned	2004-12-18T23:58:01Z
dc.date.available	2004-12-18T23:58:01Z
dc.date.issued	1997-08
dc.identifier.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.
dc.identifier.issn	0888-613X
dc.identifier.uri	http://hdl.handle.net/1808/172
dc.description.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.
dc.format.extent	343983 bytes
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.publisher	Elsevier Science Publishers B. V.
dc.subject	Local computation
dc.subject	Fusion algorithm
dc.subject	Binary join trees
dc.subject	Join trees
dc.title	Binary Join Trees for Computing Marginals in the Shenoy-Shafer Architecture
dc.type	Article
dc.identifier.orcid	https://orcid.org/0000-0002-8425-896X
dc.rights.accessrights	openAccess

Files in this item

Name:: IJAR97.pdf
Size:: 335.9Kb
Format:: PDF

View/Open

This item appears in the following Collection(s)

The University of Kansas prohibits discrimination on the basis of race, color, ethnicity, religion, sex, national origin, age, ancestry, disability, status as a veteran, sexual orientation, marital status, parental status, gender identity, gender expression and genetic information in the University’s programs and activities. The following person has been designated to handle inquiries regarding the non-discrimination policies: Director of the Office of Institutional Opportunity and Access, IOA@ku.edu, 1246 W. Campus Road, Room 153A, Lawrence, KS, 66045, (785)864-6414, 711 TTY.