Rina Dechter  Home/Search
Context Related
| uci.edu/~csp/bucketelimination.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uci.edu/~dechter/publications/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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... (Update)
Cited by: More
Planning In Hybrid Structured Stochastic - Domains Comenius University (Correct)
Scheduling Mixed Workloads in Multi-grids: The Grid.. - Mark Silberstein Dan (Correct)
Probabilistic Query Models for Transaction Data - Dmitry Pavlov University (2001) (Correct)
Similar documents (at the sentence level):
8.9%: Bucket Elimination: A Unifying Framework for Probabilistic.. - Dechter (1996) (Correct)
8.5%: Bucket Elimination: a Unifying Framework for Structure-driven.. - Dechter (1998) (Correct)
6.2%: Bucket Elimination: A Unifying Framework for Reasoning - Dechter (1999) (Correct)
Active bibliography (related documents): More All
0.9: Bucket elimination: A unifying framework for probabilistic.. - Dechter (1996) (Correct)
0.2: Stochastic Local Search for Bayesian Networks - Kask, Dechter (1999) (Correct)
0.2: Branch and Bound with Mini-Bucket Heuristics - Kask, Dechter (1999) (Correct)
Similar documents based on text: More All
0.4: A Scheme for Approximating Probabilistic Inference - Dechter, Rish (1997) (Correct)
0.4: Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998) (Correct)
0.4: Mini-Buckets: A General Scheme for Generating Approximations in.. - Dechter (1997) (Correct)
Related documents from co-citation: More All
44: Local computations with probabilities on graphical structures and their applicat.. (context) - Lauritzen, Spiegelhalter - 1988
36: Network-based heuristics for constraint-satisfaction problems (context) - Dechter, Pearl - 1988
31: Nonserial Dynamic Programming (context) - Bertele, Brioschi - 1972
BibTeX entry: (Update)
Dechter, R. (1996). Bucket elimination: A unifying framework for probabilistic inference, in E. Horvits and F. Jensen (ed.), Proc. Twelthth Conf. on Uncertainty in Artificial Intelligence, Portland, Oregon, pp. 211--219. http://citeseer.ist.psu.edu/dechter96bucket.html More
@inproceedings{ dechterdechterbucket,
author = "Rina Dechter",
title = "Bucket elimination: {A} unifying framework for probabilistic inference",
pages = "211--219",
url = "citeseer.ist.psu.edu/dechter96bucket.html" }
Citations (may not include all citations):760 Probabilistic Reasoning in Intelligent Systems (context) - Pearl - 1988
459 A computing procedure for quantification theory (context) - Davis, Putnam - 1960
166 Evaluating influence diagrams (context) - Shachter - 1986
141 Tree clustering for constraint networks (context) - Dechter, Pearl - 1989
114 Constraint networks - Dechter - 1990
109 Efficient algorithms for combinatorial problems on graphs wi.. (context) - Arnborg - 1985
72 Probabilistic inference and influence diagrams (context) - Shachter - 1988
61 Linear time algorithms for NP-hard problems restricted to pa.. (context) - Arnborg, Proskourowski - 1989
61 Directional resolution: The Davis-Putnam procedure, revisite.. - Dechter, Rish - 1994
55 Valuation-based systems for Bayesian decision analysis (context) - Shenoy - 1992
53 From influence diagrams to junction trees - Jensen, Jensen et al. - 1994
42 A computational scheme for reasoning in dynamic probabilisti.. - Kjaerulff - 1993
37 Symbolic probabilistic inference in belief networks (context) - Shachter, D'Ambrosio et al. - 1990
35 Decision making using probabilistic inference methods (context) - Shachter, Peot - 1992
34 the generation of alternative explanations with implications.. - Santos - 1991
32 A new algorithm for finding MAP assignments to belief networ.. (context) - Shimony, Charniack - 1991
29 Nonserial Dynamic Programming (context) - Bertele, Brioschi - 1972
29 Dynamic programming and influence diagrams (context) - Tatman, Shachter - 1990
28 Graphical models for preference and utility - Bacchus, Groove - 1995
26 Probabilistic reasoning in predictive expert systems (context) - Spiegelhalter - 1986
25 A connectionist model for diagnostic problem solving (context) - Peng, Reggia - 1989
19 Topological parameters for time-space trade-off - Dechter - 1996
8 Plausability of diagnostic hypothesis (context) - Peng, Reggia - 1986
6 Nestor: A computer-based medical diagnosis aid that integrat.. (context) - Cooper - 1984
5 Local and global relational consistency - Summary of recent .. (context) - Dechter, van Beek - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.ics.uci.edu/~dechter/publications/): More
Up and Down Mini-Buckets: A Scheme for Approximating.. - Kask, Larrosa, Dechter (2001) (Correct)
Mini-Buckets: A General Scheme for Approximating Inference - Dechter, Rish (1998) (Correct)
On the Time Complexity of Bucket Elimination Algorithms - Larrosa (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC