Efficient Peer-to-Peer Belief Propagation Export

@incollection{schmidt-aberer-coopis06, abstract = {In this paper, we will present an efficient approach for distributed inference. We use belief propagation's message-passing algorithm on top of a DHT storing a Bayesian network. Nodes in the DHT run a variant of the spring relaxation algorithm to redistribute the Bayesian network among them. Thereafter correlated data is stored close to each other reducing the message cost for inference. We simulated our approach in Matlab and show the message reduction and the achieved load balance for random, tree-shaped, and scale-free Bayesian networks of different sizes. As possible application, we envision a distributed software knowledge base maintaining encountered software bugs under users' system configurations together with possible solutions for other users having similar problems. Users would not only be able to repair their system but also to foresee possible problems if they would install software updates or new applications.}, author = {Schmidt, Roman and Aberer, Karl}, citeulike-article-id = {3662324}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/11914853_31}, citeulike-linkout-1 = {http://www.springerlink.com/content/v3m2717m2334564h}, doi = {10.1007/11914853_31}, journal = {On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE}, keywords = {distributed, lbp}, pages = {516--532}, posted-at = {2009-05-17 22:07:38}, priority = {2}, title = {Efficient Peer-to-Peer Belief Propagation}, url = {http://dx.doi.org/10.1007/11914853_31}, year = {2006} }

TY - CHAP ID - schmidt-aberer-coopis06 L3 - citeulike-article-id:3662324 N2 - In this paper, we will present an efficient approach for distributed inference. We use belief propagation’s message-passing algorithm on top of a DHT storing a Bayesian network. Nodes in the DHT run a variant of the spring relaxation algorithm to redistribute the Bayesian network among them. Thereafter correlated data is stored close to each other reducing the message cost for inference. We simulated our approach in Matlab and show the message reduction and the achieved load balance for random, tree-shaped, and scale-free Bayesian networks of different sizes. As possible application, we envision a distributed software knowledge base maintaining encountered software bugs under users’ system configurations together with possible solutions for other users having similar problems. Users would not only be able to repair their system but also to foresee possible problems if they would install software updates or new applications. JF - On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE EP - 532 TI - Efficient Peer-to-Peer Belief Propagation SP - 516 KW - distributed KW - lbp AU - Schmidt, Roman AU - Aberer, Karl PY - 2006/// UR - http://dx.doi.org/10.1007/11914853_31 ER -