Graphs and algorithms
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Algorithmic graph theory
Sidestepping the triangulation problem in Bayesian net computations
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Evidence Absorption and Propagation through Evidence Reversals
UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Axioms for probability and belief-function proagation
UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
Decomposition of structural learning about directed acyclic graphs
Artificial Intelligence
Review: learning bayesian networks: Approaches and issues
The Knowledge Engineering Review
A bayesian network riverine model study
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
All roads lead to Rome---New search methods for the optimal triangulation problem
International Journal of Approximate Reasoning
Efficiently adapting graphical models for selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
| Hi-index | 0.00 |
The paper deals with optimality issues in connection with updating beliefs in networks. We address two processes: triangulation and construction of junction trees. In the first part, we give a simple algorithm for constructing an optimal junction tree from a triangulated network. In the second part, we argue that any exact method based on local calcuIations must either be less efficient than the junction tree method, or it has an optimality problem equivalent to that of triangulation.