mlsanityData to 7 Oct 2026

Bucket Elimination: A Unifying Framework for Several Probabilistic Inference

arXiv 1302.3572 ↗First posted 13 Feb 2013cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

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 this framework. Bounds on complexity are given for all the algorithms as a function of the problem's structure.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 13 Feb 2013.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 5; 2022: 5; 2023: 1; 2024: 1; 2025: 1.

13 papers.

Sort: