• DOI:10.1007/978-94-011-5014-9_4
Corpus ID: 10450863

Bucket elimination: A unifying framework for probabilistic inference

@inproceedings{Dechter1996BucketEA,
  title={Bucket elimination: A unifying framework for probabilistic inference},
  author={R. Dechter},
  booktitle={UAI},
  year={1996}
}

R. Dechter

Published in UAI 1996

Computer Science, Mathematics

Probabilistic inference algorithms for finding the most probable explanation, the maximum aposteriori hypothesis, and the maximum expected utility and for updating belief are reformulated as an elimination-type algorithm called bucket elimination. This emphasizes the principle common to many of the algorithms appearing in that literature and clarifies their relationship to nonserial dynamic programming algorithms. We also present a general way of combining conditioning and elimination within… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed