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

Full metadata record

DC FieldValueLanguage
dc.contributor.authorShafer, Glenn R.-
dc.contributor.authorShenoy, Prakash P.-
dc.date.accessioned2005-10-24T22:56:23Z-
dc.date.available2005-10-24T22:56:23Z-
dc.date.issued1990-03-
dc.identifier.citationShafer, G. R. and P. P. Shenoy, "Probability Propagation," Annals of Mathematics and Artificial Intelligence, Vol. 2, Nos. 1--4, 1990, pp. 327--351.en
dc.identifier.issn1012-2443-
dc.identifier.urihttp://hdl.handle.net/1808/750-
dc.description.abstractIn this paper we give a simple account of local computation of marginal probabilities for when the joint probability distribution is given in factored form and the sets of variables involved in the factors form a hypertree. Previous expositions of such local computation have emphasized conditional probability. We believe this emphasis is misplaced. What is essential to local computation is a factorization. It is not essential that this factorization be interpreted in terms of conditional probabilities. The account given here avoids the divisions required by conditional probabilities and generalizes readily to alternative measures of subjective probability, such Dempster-Shafer or Spohnian belief functions.en
dc.format.extent249967 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen_US-
dc.publisherAnnals of Mathematics and Artificial Intelligenceen
dc.subjectprobability propagationen
dc.subjectlocal computationen
dc.subjecthypertreeen
dc.subjectconstruction sequenceen
dc.subjectMarkov treeen
dc.subjectparallel processingen
dc.titleProbability Propagationen
dc.typeArticleen
Appears in Collections:School of Business Articles

Files in this Item:

File Description SizeFormat
AMAI90.pdf244.11 kBAdobe PDFView/Open