A Hybrid Factored Frontier Algorithm for Dynamic Bayesian Networks with a Biopathways Application

Dynamic Bayesian Networks (DBNs) can serve as succinct probabilistic dynamic models of biochemical networks [1]. To analyze these models, one must compute the probability distribution over system states at a given time point. Doing this exactly is infeasible for large models; hence one must use approximate algorithms. The Factored Frontier algorithm (FF) is one such algorithm [2]. However FF as well as the earlier Boyen-Koller (BK) algorithm [3] can incur large errors. To address this, we present a new approximate algorithm called the Hybrid Factored Frontier (HFF) algorithm. At each time slice, in addition to maintaining probability distributions over local states-as FF does-HFF explicitly maintains the probabilities of a number of global states called spikes. When the number of spikes is 0, we get FF and with all global states as spikes, we get the exact inference algorithm. We show that by increasing the number of spikes one can reduce errors while the additional computational effort required is only quadratic in the number of spikes. We validated the performance of HFF on large DBN models of biopathways. Each pathway has more than 30 species and the corresponding DBN has more than 3,000 nodes. Comparisons with FF and BK show that HFF is a useful and powerful approximate inferencing algorithm for DBNs.

[1]  D. Lauffenburger,et al.  Physicochemical modelling of cell signalling pathways , 2006, Nature Cell Biology.

[2]  Ursula Klingmüller,et al.  Theoretical and experimental analysis links isoform- specific ERK signalling to cell fate decisions , 2009, Molecular systems biology.

[3]  Xavier Boyen,et al.  Exploiting the Architecture of Dynamic Systems , 1999, AAAI/IAAI.

[4]  Jacky L. Snoep,et al.  BioModels Database: a free, centralized database of curated, published, quantitative kinetic models of biochemical and cellular systems , 2005, Nucleic Acids Res..

[5]  Kevin Murphy,et al.  Bayes net toolbox for Matlab , 1999 .

[6]  Boris N. Kholodenko,et al.  Untangling the signalling wires , 2007, Nature Cell Biology.

[7]  Michael Hucka,et al.  A Correction to the Review Titled "Rules for Modeling Signal-Transduction Systems" by W. S. Hlavacek et al. , 2006, Science's STKE.

[8]  Marta Kwiatkowska,et al.  Probabilistic model checking for systems biology , 2011 .

[9]  François Fages,et al.  On the Analysis of Numerical Data Time Series in Temporal Logic , 2007, CMSB.

[10]  Jung-Fu Cheng,et al.  Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm , 1998, IEEE J. Sel. Areas Commun..

[11]  David R. Gilbert,et al.  A Model Checking Approach to the Parameter Estimation of Biochemical Pathways , 2008, CMSB.

[12]  David R. Gilbert,et al.  Analysis of Signalling Pathways Using Continuous Time Markov Chains , 2006, Trans. Comp. Sys. Biology.

[13]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[14]  David Hsu,et al.  A decompositional approach to parameter estimation in pathway modeling: a case study of the Akt and MAPK pathways and their crosstalk , 2006, ISMB.

[15]  P. S. Thiagarajan,et al.  A hybrid factored frontier algorithm for dynamic Bayesian network models of biopathways , 2011, CMSB.

[16]  David Hsu,et al.  Incremental Signaling Pathway Modeling by Data Integration , 2010, RECOMB.

[17]  Rina Dechter,et al.  An Anytime Scheme for Bounding Posterior Beliefs , 2006, AAAI.

[18]  David Hsu,et al.  Probabilistic Approximations of Signaling Pathway Dynamics , 2009, CMSB.

[19]  Radu Grosu,et al.  Monte Carlo Model Checking , 2005, TACAS.

[20]  Nir Friedman,et al.  Inferring Cellular Networks Using Probabilistic Graphical Models , 2004, Science.

[21]  Patrick Lincoln.  Invited Talk: Symbolic Systems Biology , 2003, RTA.

[22]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[23]  Axel Legay,et al.  A Bayesian Approach to Model Checking Biological Systems , 2009, CMSB.

[24]  Sumit Kumar Jha,et al.  Temporal-logics as query languages for dynamic Bayesian networks: application to D. melanogaster embryo development , 2006 .

[25]  Daniel P. Huttenlocher,et al.  Efficient Belief Propagation for Early Vision , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[26]  Kevin P. Murphy,et al.  The Factored Frontier Algorithm for Approximate Inference in DBNs , 2001, UAI.

[27]  Muffy Calder,et al.  Some Investigations Concerning the CTMC and the ODE Model Derived From Bio-PEPA , 2009, FBTC@ICALP.

[28]  Nir Friedman,et al.  Probabilistic Graphical Models - Principles and Techniques , 2009 .

[29]  David Hsu,et al.  Probabilistic approximations of ODEs based bio-pathway dynamics , 2011, Theor. Comput. Sci..

[30]  David Hsu,et al.  A Computational and Experimental Study of the Regulatory Mechanisms of the Complement System , 2011, PLoS Comput. Biol..

[31]  Vincent Danos,et al.  Rule-Based Modelling of Cellular Signalling , 2007, CONCUR.

[32]  K. H. Lee,et al.  The statistical mechanics of complex signaling networks: nerve growth factor signaling , 2004, Physical biology.

[33]  Xavier Boyen,et al.  Tractable Inference for Complex Stochastic Processes , 1998, UAI.

[34]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[35]  Thomas A. Henzinger,et al.  Sliding Window Abstraction for Infinite Markov Chains , 2009, CAV.

[36]  Thomas A. Henzinger,et al.  Approximation of event probabilities in noisy cellular processes , 2009, Theor. Comput. Sci..

[37]  Hui Lin,et al.  Online adaptive learning for speech recognition decoding , 2010, INTERSPEECH.