论文信息 - Learning Genetic and Gene Bayesian Networks with Hidden Variables: Bilayer Verification Algorithm

Learning Genetic and Gene Bayesian Networks with Hidden Variables: Bilayer Verification Algorithm

To improve the recovery of gene-gene and marker-gene (eQTL) interaction networks from microarray and genetic data, we propose a new procedure for learning Bayesian networks. This algorithm, termed Bilayer Verification, starts with a user-specified leaf node, and then searches upstream to locate portions of the biological interaction network that can be verified as unconfounded by hidden variables such as protein levels. We provide theoretical justification for this procedure, which learns Bayesian networks by recursively finding two levels of v-structures in the data. We discuss the specialization and efficiencies gained when exogenous variables (those with no parents) such as genetic markers can be included in the network.

Jason E. Aten | J. Aten

[1] Richard E. Neapolitan,et al. Learning Bayesian networks , 2007, KDD '07.

[2] Paul R. Cohen,et al. Two Algorithms for Inducing Structural Equation Models from Data , 1994, AISTATS.

[3] Judea Pearl,et al. Equivalence and Synthesis of Causal Models , 1990, UAI.

[4] Gregory F. Cooper,et al. A Simple Constraint-Based Algorithm for Efficiently Mining Observational Databases for Causal Relationships , 1997, Data Mining and Knowledge Discovery.

[5] R. Stoughton,et al. Genetics of gene expression surveyed in maize, mouse and man , 2003, Nature.

[6] J. Pearl. Causality: Models, Reasoning and Inference , 2000 .

[7] J. Castle,et al. An integrative genomics approach to infer causal associations between gene expression and disease , 2005, Nature Genetics.

[8] A. Dawid. Conditional Independence in Statistical Theory , 1979 .

[9] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .