Parallel Bayesian network structure learning with application to gene networks

Authors:
Olga Nikolova;Srinivas Aluru
Affiliations:
Iowa State University, Ames, Iowa;Iowa State University, Ames, Iowa, Mumbai, India
Venue:
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Year:
2012

Citing 10
Cited 0

A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
Learning Bayesian networks from data: an information-theory based approach

Artificial Intelligence
Structure Search and Stability Enhancement of Bayesian Networks

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
The max-min hill-climbing Bayesian network structure learning algorithm

Machine Learning
Learning Bayesian Networks

Learning Bayesian Networks
Parallel Information-Theory-Based Construction of Genome-Wide Gene Regulatory Networks

IEEE Transactions on Parallel and Distributed Systems
Estimating Genome-Wide Gene Networks Using Nonparametric Bayesian Network Models on Massively Parallel Computers

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Parallel Discovery of Direct Causal Relations and Markov Boundaries with Applications to Gene Networks

ICPP '11 Proceedings of the 2011 International Conference on Parallel Processing
Learning bayesian network structure from massive datasets: the «sparse candidate« algorithm

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bayesian networks (BN) are probabilistic graphical models which are widely utilized in various research areas, including modeling complex biological interactions in the cell. Learning the structure of a BN is an NP-hard problem and exact solutions are limited to a few tens of variables. In this work, we present a parallel BN structure learning algorithm that combines principles of both heuristic and exact approaches and facilitates learning of larger networks. We demonstrate the applicability of our approach by an implementation on a Cray AMD cluster, and present experimental results for the problem of inferring gene networks. Our approach is work-optimal and achieves nearly perfect scaling.