Learning the structure of dynamic Bayesian networks from time series and steady state measurements

被引:33
作者
Lahdesmaki, Harri [1 ,2 ]
Shmulevich, Ilya [1 ]
机构
[1] Inst Syst Biol, Seattle, WA 98103 USA
[2] Tampere Univ Technol, Dept Signal Proc, Tampere, Finland
关键词
dynamic Bayesian networks; steady state analysis; Bayesian inference; Markov chain Monte Carlo; trans-dimensional Markov chain Monte Carlo;
D O I
10.1007/s10994-008-5053-y
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dynamic Bayesian networks (DBN) are a class of graphical models that has become a standard tool for modeling various stochastic time-varying phenomena. In many applications, the primary goal is to infer the network structure from measurement data. Several efficient learning methods have been introduced for the inference of DBNs from time series measurements. Sometimes, however, it is either impossible or impractical to collect time series data, in which case, a common practice is to model the non-time series observations using static Bayesian networks (BN). Such an approach is obviously sub-optimal if the goal is to, gain insight into the underlying dynamical model. Here, we introduce Bayesian methods for the inference of DBNs from steady state measurements. We also consider learning the structure of DBNs from a combination of time series and steady state measurements. We introduce two different methods: one that is based on an approximation and another one that provides exact computation. Simulation results demonstrate that dynamic network structures can be learned to an extent from steady state measurements alone and that inference from a combination of steady state and time series data has the potential to improve learning performance relative to the inference from time series data alone.
引用
收藏
页码:185 / 217
页数:33
相关论文
共 46 条
[1]   Model selection by MCMC computation [J].
Andrieu, C ;
Djuric, PM ;
Doucet, A .
SIGNAL PROCESSING, 2001, 81 (01) :19-37
[2]  
[Anonymous], 2002, THESIS U C BERKELEY
[3]  
[Anonymous], 2005, MONTE CARLO STAT MET
[4]  
[Anonymous], INTRO STOCHASTIC PRO
[5]  
[Anonymous], 1997, ARPACK Users' Guide: Solution of Large Scale Eigenvalue Problems by Implicitly Restarted Arnoldi Methods, DOI 10.1137/1.9780898719628
[6]  
Bernard A, 2005, PACIFIC SYMPOSIUM ON BIOCOMPUTING 2005, P459
[7]   Nonparametric convergence assessment for MCMC model selection [J].
Brooks, SP ;
Giudici, P ;
Philippe, A .
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2003, 12 (01) :1-22
[8]   An approximation method for solving the steady-state probability distribution of probabilistic Boolean networks [J].
Ching, Wai-Ki ;
Zhang, Shuqin ;
Ng, Michael K. ;
Akutsu, Tatsuya .
BIOINFORMATICS, 2007, 23 (12) :1511-1518
[9]  
COOPER GF, 1992, MACH LEARN, V9, P309, DOI 10.1007/BF00994110
[10]  
Cowell R. G., 1999, PROBABILISTIC NETWOR