Logarithmic Time Parallel Bayesian Inference
David Pennock
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(log n) on a CREW PRAM (concurrentread, exclusivewrite parallel randomaccess 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.
Keywords: Probabilistic inference, parallel algorithms, Bayesian networks.
Pages: 431438
PS Link: http://www.eecs.umich.edu/~dpennock/homepage/papers/parallelfinal.ps
PDF Link: /papers/98/p431pennock.pdf
BibTex:
@INPROCEEDINGS{Pennock98,
AUTHOR = "David Pennock
",
TITLE = "Logarithmic Time Parallel Bayesian Inference",
BOOKTITLE = "Proceedings of the Fourteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI98)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "1998",
PAGES = "431438"
}

