A Distributed Learning Algorithm for Bayesian Inference Networks
Lists
Only you see this
Abstract
We present a new distributed algorithm for computing the minimum description length (MDL) in learning Bayesian inference networks from data. Our learning algorithm exploits both properties of the MDL-based score metric and a distributed, asynchronous, adaptive search technique called nagging. Nagging is intrinsically fault-tolerant, has dynamic load balancing features, and scales well. We demonstrate the viability, effectiveness, and scalability of our approach empirically with several experiments using networked machines. More specifically, we show that our distributed algorithm can provide optimal solutions for larger problems as well as good solutions for Bayesian networks of up to 150 variables.
BibTeX
@article{lam2002distributed,
author = {Wai Lam and Alberto Maria Segre},
title = {{A Distributed Learning Algorithm for Bayesian Inference Networks}},
journal = {IEEE Trans. Knowl. Data Eng.},
year = {2002},
url = {https://openreview.net/forum?id=FNz9R8xuYA},
}Loading related content...