## Logarithmic Time Parallel Bayesian Inference (1998)

Venue: | Proc. 14th Conf. Uncertainty in Artificial Intelligence |

Citations: | 30 - 0 self |

### BibTeX

@INPROCEEDINGS{Pennock98logarithmictime,

author = {David Pennock},

title = {Logarithmic Time Parallel Bayesian Inference},

booktitle = {Proc. 14th Conf. Uncertainty in Artificial Intelligence},

year = {1998},

pages = {431--438},

publisher = {Morgan Kaufmann}

}

### Years of Citing Articles

### OpenURL

### Abstract

I present a parallel algorithm for exact probabilistic inference in Bayesian networks. For polytree networks with n variables, the worstcase time complexity is O(logn) on a CREW PRAM (concurrent-read, exclusive-write parallel random-access machine) with n processors, for any constant number of evidence variables. For arbitrary networks, the time complexity is O(r 3w log n) for n processors, or O(w log n) for r 3w n processors, where r is the maximum range of any variable, and w is the induced width (the maximum clique size), after moralizing and triangulating the network. 1 INTRODUCTION Two key breakthroughs make representation of and reasoning with probabilities practical, and have led to a proliferation of related research within the artificial intelligence community. Bayesian networks exploit conditional independence to represent joint probability distributions compactly, and associated inference algorithms evaluate arbitrary conditional probabilities implied by the network r...