Abstract:
18071- Granada- Spain Abstract. Different uncertainty propagation algorithms in graphical structures can be viewed as a particular case of propagation in a joint tree, which can be obtained from different triangulations of the original graph. The complexity of the resulting propagation algorithms depends on the size of the resu lting triangulated graph. The prob lem of obtaining an optimum graph triangu lation is known to be NP-complete. Thus approximate algorithms which find a good triangulation in reasonable time are of particular interest. This work describes and compares several heuristic algorithms developed for this purpose. 1
Citations
|
4539
|
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
– Pearl
- 1988
|
|
2405
|
Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images
– Geman, Geman
- 1984
|
|
280
|
Evaluating Influence Diagrams
– Shachter
- 1986
|
|
245
|
Fusion, propagation, and structuring in belief networks
– Pearl
- 1986
|
|
171
|
Simple linear-time algorithms to tests chordiality of graphs, tests acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
– Tarjan, Yannakakis
- 1984
|
|
96
|
Axioms for probability and belief-function propagation
– Shenoy, Shafer
- 1990
|
|
87
|
Probabilistic Inference and Influence Diagrams.” Ops. Rsrch. 36 (July-August
– Shachter
- 1988
|
|
81
|
Probability propagation
– Shafer, Shenoy
- 1990
|
|
71
|
Probabilistic inference using belief networks is NP-Hard
– Cooper
- 1988
|
|
57
|
A computational model for causal and diagnostic reasoning
– Kim, Pearl
- 1983
|
|
49
|
Symbolic probabilistic inference in belief networks
– Shachter, D'Ambrosio, et al.
- 1990
|
|
48
|
On Representing and Solving Decision Problems
– Olmsted
- 1983
|
|
34
|
A constraint-propagation approach to probabilistic reasoning, in Uncertainty and Arti cial Intelligence
– Pearl
- 1986
|
|
30
|
An axiomatic framework for propagating uncertainty in directed acyclic networks
– Cano, Delgado, et al.
- 1993
|
|
29
|
Multivariate Belief Functions and Graphical Models
– Kong
|
|
25
|
Propagation of uncertainty by logic sampling in Bayes’ networks
– Henrion
- 1988
|
|
21
|
The equivalence of exact methods for probabilistic inference on belief networks
– Shachter, Andersen, et al.
- 1991
|
|
2
|
Triangulation of graphs-algorithms giving total state space
– Kjaerulff
- 1990
|
|
2
|
Local computation with probab ilities on graph ical structures and their application to expert systems
– Lauritzen, Spiegelharter
- 1988
|
|
1
|
Proskurowsk i (1987) Comp lexity of finding embedd ings in a k-tree
– Arnborg, G
|
|
1
|
Bayesian network inference using simu lation
– Chin, Cooper
- 1989
|
|
1
|
The computationa l comp lexity of probabilistic inference using bayesian belief networks is NP-hard
– Cooper
|
|
1
|
Junction trees and decomposab le hypergraphs, Research report, Judex Datasystemer A/S, Aa lborg
– Jensen
|
|
