.png){kind=icon}
返回
Fast Approximate Score Computation on Large-Scale Distributed Data for Learning Multinomial Bayesian Networks
.png){kind=icon}
OA
AI
DOI：10.1145/3301304.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we focus on the problem of learning a Bayesian network over distributed data stored in a commodity cluster. Specifically, we address the challenge of computing the scoring function over distributed data in an efficient and scalable manner, which is a fundamental task during learning. While exact score computation can be done using the MapReduce-style computation, our goal is to compute approximate scores much faster with probabilistic error bounds and in a scalable manner. We propose a novel approach, which is designed to achieve the following: (a) decentralized score computation using the principle of gossiping; (b) lower resource consumption via a probabilistic approach for maintaining scores using the properties of a Markov chain; and (c) effective distribution of tasks during score computation (on large datasets) by synergistically combining well-known hashing techniques. We conduct theoretical analysis of our approach in terms of convergence speed of the statistics required for score computation, and memory and network bandwidth consumption. We also discuss how our approach is capable of efficiently recomputing scores when new data are available. We conducted a comprehensive evaluation of our approach and compared with the MapReduce-style computation using datasets of different characteristics on a 16-node cluster. When theMapReduce-style computation provided exact statistics for score computation, it was nearly 10 times slower than our approach. Although it ran faster on randomly sampled datasets than on the entire datasets, it performed worse than our approach in terms of accuracy. Our approach achieved high accuracy (below 6% average relative error) in estimating the statistics for approximate score computation on all the tested datasets. In conclusion, it provides a feasible tradeoff between computation time and accuracy for fast approximate score computation on large-scale distributed data.
Keyword:
Approximate score computation
bayesian networks
structure learning
distributed data
gossip algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.3K
被引数:
4.4K
机构
引用论文
Searching for exotic particles in high-energy physics with deep learning用深度学习寻找高能物理中的奇异粒子.png)
NATURE COMMUNICATIONS
NATURE COMMUNICATIONSIF15.7
PREAI
分享收藏Evaluation of The Effects of Carob (Ceratonia siliqua L.) Fruits on the Puberty of Rats评价洋荜澄茄（Ceratonia siliqua L.）果实对大鼠青春期的影响
OAAI
OAAI分享收藏Learning distributed discrete Bayesian Network Classifiers under MapReduce with Apache Spark使用Apache Spark在MapReduce下学习分布式离散贝叶斯网络分类器
PREAI
分享收藏
查看更多内容