The Community for Technology Leaders
RSS Icon
Issue No.01 - January/February (2002 vol.14)
pp: 93-105
<p><b>Abstract</b>—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.</p>
data mining, Bayesian networks, minimum description length principle, distributed systems
W. Lam, Am. Segre, "A Distributed Learning Algorithm for Bayesian Inference Networks", IEEE Transactions on Knowledge & Data Engineering, vol.14, no. 1, pp. 93-105, January/February 2002, doi:10.1109/69.979975
24 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool