Show simple item record

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.
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.
dc.format.extent249967 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherAnnals of Mathematics and Artificial Intelligence
dc.subjectProbability propagation
dc.subjectLocal computation
dc.subjectHypertree
dc.subjectConstruction sequence
dc.subjectMarkov tree
dc.subjectParallel processing
dc.titleProbability Propagation
dc.typeArticle
dc.identifier.orcidhttps://orcid.org/0000-0002-8425-896X
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record