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

  • Authors:

  • Sucheendra K. Palaniappan;S. Akshay;Bing Liu;Blaise Genest;P. S. Thiagarajan

  • Affiliations:

  • National University of Singapore, Singapore;IRISA, Rennes;National University of Singapore, Singapore;French CNRS and Joint French-Sinagapore Laboratory, Singapore and IRISA, Rennes;National University of Singapore, Singapore

  • Venue:
  • IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dynamic Bayesian Networks (DBNs) can serve as succinct probabilistic dynamic models of biochemical networks [CHECK END OF SENTENCE]. 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 [CHECK END OF SENTENCE]. However FF as well as the earlier Boyen-Koller (BK) algorithm [CHECK END OF SENTENCE] 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.