TY - JOUR
T1 - Computational Properties of Two Exact Algorithms for Bayesian Networks
AU - Zhang, Nevin Lianwen
PY - 1998
Y1 - 1998
N2 - This paper studies computational properties of two exact inference algorithms for Bayesian networks, namely the clique tree propagation 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 and CTP. We found that, contrary to common beliefs, VE is often more efficient than CTP, especially in complex networks.
AB - This paper studies computational properties of two exact inference algorithms for Bayesian networks, namely the clique tree propagation 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 and CTP. We found that, contrary to common beliefs, VE is often more efficient than CTP, especially in complex networks.
KW - Bayesian networks
KW - Computational properties
KW - Inference algorithms
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:000075799700006
UR - https://openalex.org/W1528271421
UR - https://www.scopus.com/pages/publications/0032166467
U2 - 10.1023/A:1008272220579
DO - 10.1023/A:1008272220579
M3 - Journal Article
SN - 0924-669X
VL - 9
SP - 173
EP - 183
JO - Applied Intelligence
JF - Applied Intelligence
IS - 2
ER -