Computational Properties of Two Exact Algorithms for Bayesian Networks

Authors:
Nevin Lianwen Zhang
Affiliations:
Department of Computer Science, University of Science and Technology, Hong Kong, China. E-mail: lzhang@cs.ust.hk
Venue:
Applied Intelligence
Year:
1998

Citing 12
Cited 6

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Evaluating influence diagrams

Operations Research
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic inference and influence diagrams

Operations Research
Valuation-based systems for Bayesian decision analysis

Operations Research
Studies on hypergraphs I: hyperforests

Discrete Applied Mathematics
Probabilistic Expert Systems

Probabilistic Expert Systems
d-Separation: From Theorems to Algorithms

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence
Pruning bayesian networks for efficient computation

UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Exploiting causal independence in Bayesian network inference

Journal of Artificial Intelligence Research
Bucket elimination: a unifying framework for probabilistic inference

UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence

A join tree probability propagation architecture for semantic modeling

Journal of Intelligent Information Systems
Evaluate the quality of foundational software platform by Bayesian network

AICI'10 Proceedings of the 2010 international conference on Artificial intelligence and computational intelligence: Part II
Intelligent fault inference for rotating flexible rotors using Bayesian belief network

Expert Systems with Applications: An International Journal
Evaluating probabilistic inference techniques: a question of "When," not "Which"

SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
A search problem in complex diagnostic Bayesian networks

Knowledge-Based Systems
An improved LAZY-AR approach to bayesian network inference

AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies computational properties of twoexact inference algorithms for Bayesian networks, namely the clique treepropagation algorithm (CTP)^1 and the variable elimination algorithm (VE). VE permits pruning of nodes irrelevant to a query while CTP facilitates sharing of computations among different queries.Experiments have been conducted to empirically compare VE andCTP. We found that, contrary to common beliefs, VE is often moreefficient than CTP, especially in complex networks.