A parallel algorithm for Bayesian network structure learning from large data sets

详细信息    查看全文

• 作者：Anders L. Madsen ; ^a ; ^b ; ^{alm@hugin.com} ; Frank Jensen^a ; ^fj@hugin.com ; Antonio Salmeró ; n^d ; ^{antonio.salmeron@ual.es} ; Helge Langseth^c ; ^{helgel@idi.ntnu.no} ; Thomas D. Nielsen^b ; ^{tdn@cs.aau.dk}
• 关键词：Bayesian network ; PC algorithm ; Parallelization
• 刊名：Knowledge-Based Systems
• 出版年：2017
• 出版时间：1 February 2017
• 年：2017
• 卷：117
• 期：Complete
• 页码：46-55
• 全文大小：772 K
• 卷排序：117

文摘

This paper considers a parallel algorithm for Bayesian network structure learning from large data sets. The parallel algorithm is a variant of the well known PC algorithm. The PC algorithm is a constraint-based algorithm consisting of five steps where the first step is to perform a set of (conditional) independence tests while the remaining four steps relate to identifying the structure of the Bayesian network using the results of the (conditional) independence tests. In this paper, we describe a new approach to parallelization of the (conditional) independence testing as experiments illustrate that this is by far the most time consuming step. The proposed parallel PC algorithm is evaluated on data sets generated at random from five different real-world Bayesian networks. The algorithm is also compared empirically with a process-based approach where each process manages a subset of the data over all the variables on the Bayesian network. The results demonstrate that significant time performance improvements are possible using both approaches.