Advances to Bayesian network inference for generating causal networks from observational biological data

Motivation: Network inference algorithms are powerful computational tools for identifying putative causal interactions among variables from observational data. Bayesian network inference algorithms hold particular promise in that they can capture linear, non-linear, combinatorial, stochastic and oth...

Full description

Saved in:
Bibliographic Details
Published inBioinformatics Vol. 20; no. 18; pp. 3594 - 3603
Main Authors Yu, Jing, Smith, V. Anne, Wang, Paul P., Hartemink, Alexander J., Jarvis, Erich D.
Format Journal Article
LanguageEnglish
Published Oxford Oxford University Press 12.12.2004
Oxford Publishing Limited (England)
Subjects
Online AccessGet full text
ISSN1367-4803
1460-2059
1367-4811
DOI10.1093/bioinformatics/bth448

Cover

More Information
Summary:Motivation: Network inference algorithms are powerful computational tools for identifying putative causal interactions among variables from observational data. Bayesian network inference algorithms hold particular promise in that they can capture linear, non-linear, combinatorial, stochastic and other types of relationships among variables across multiple levels of biological organization. However, challenges remain when applying these algorithms to limited quantities of experimental data collected from biological systems. Here, we use a simulation approach to make advances in our dynamic Bayesian network (DBN) inference algorithm, especially in the context of limited quantities of biological data. Results: We test a range of scoring metrics and search heuristics to find an effective algorithm configuration for evaluating our methodological advances. We also identify sampling intervals and levels of data discretization that allow the best recovery of the simulated networks. We develop a novel influence score for DBNs that attempts to estimate both the sign (activation or repression) and relative magnitude of interactions among variables. When faced with limited quantities of observational data, combining our influence score with moderate data interpolation reduces a significant portion of false positive interactions in the recovered networks. Together, our advances allow DBN inference algorithms to be more effective in recovering biological networks from experimentally collected data. Availability: Source code and simulated data are available upon request. Supplementary information: http://www.jarvislab.net/Bioinformatics/BNAdvances/
Bibliography:istex:55E9866FFAA7614504D18B79A2D2752B52461721
ark:/67375/HXZ-F8CJ14GK-C
local:bth448
Contact: yu@ee.duke.edu; amink@cs.duke.edu; jarvis@neuro.duke.edu
ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ObjectType-Undefined-1
ObjectType-Feature-3
ISSN:1367-4803
1460-2059
1367-4811
DOI:10.1093/bioinformatics/bth448