dc.contributor.author | Shafer, Glenn R. | |
dc.contributor.author | Shenoy, Prakash P. | |
dc.date.accessioned | 2005-10-24T22:56:23Z | |
dc.date.available | 2005-10-24T22:56:23Z | |
dc.date.issued | 1990-03 | |
dc.identifier.citation | Shafer, 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.issn | 1012-2443 | |
dc.identifier.uri | http://hdl.handle.net/1808/750 | |
dc.description.abstract | In 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.extent | 249967 bytes | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | |
dc.publisher | Annals of Mathematics and Artificial Intelligence | |
dc.subject | Probability propagation | |
dc.subject | Local computation | |
dc.subject | Hypertree | |
dc.subject | Construction sequence | |
dc.subject | Markov tree | |
dc.subject | Parallel processing | |
dc.title | Probability Propagation | |
dc.type | Article | |
dc.identifier.orcid | https://orcid.org/0000-0002-8425-896X | |
dc.rights.accessrights | openAccess | |