Dynamic Bayesian Network
Also known as: DBN, temporal Bayesian network, dynamic probabilistic graphical model, two-slice temporal Bayesian network
A Dynamic Bayesian Network (DBN) extends a standard Bayesian network over time by representing how a set of random variables evolve across discrete time steps. It captures both the conditional independence structure among variables at each instant and the probabilistic dependencies between consecutive time slices, enabling principled reasoning about temporal processes under uncertainty.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+5 more
When to use it
Use a DBN when your data are sequential or time-stamped, you believe the system follows a Markov process, and you want explicit probabilistic reasoning about latent states — for example in tracking, fault detection, or speech recognition. DBNs are especially valuable when observations are incomplete or noisy and you need uncertainty propagation over time. Avoid DBNs when the Markov assumption is clearly violated by long-range dependencies (consider higher-order or recurrent neural models instead), when your time series is very long and exact inference is intractable without approximations you cannot validate, or when you have abundant labelled data and prediction accuracy alone matters (discriminative sequential models such as CRFs may outperform).
Strengths & limitations
- Provides a principled probabilistic framework for temporal data with explicit uncertainty at every time step.
- Encodes domain knowledge through the graph structure, making models interpretable and auditable.
- Subsumes important special cases — HMMs and Kalman filters — under a single unified framework.
- Handles missing observations naturally through marginalisation over hidden variables.
- Supports both filtering (online) and smoothing (offline) inference within the same model.
- Exact inference is exponential in the tree-width of the unrolled network, forcing approximations for complex models or long sequences.
- The first-order Markov assumption may be inadequate for processes with long memory, requiring higher-order extensions that increase complexity.
- Structure learning from data is NP-hard in general; the graph topology is often fixed by the analyst in practice.
- Parameter learning with EM can converge to poor local optima and is sensitive to initialisation.
Frequently asked
How does a DBN differ from a standard Bayesian network?
A standard Bayesian network represents a static joint distribution over a fixed set of variables. A DBN extends this to sequences by introducing time-indexed copies of the variables and inter-slice arcs that encode temporal dependencies, turning it into a probabilistic model for stochastic processes.
Is a Hidden Markov Model a special case of a DBN?
Yes. An HMM is a DBN with a single discrete hidden state variable per time slice and one or more observed output variables, where the hidden state depends only on the previous hidden state. The DBN framework generalises HMMs to multiple interacting hidden and observed variables.
What inference algorithm should I choose?
For small discrete DBNs, exact junction-tree or variable-elimination algorithms are feasible. For continuous or high-dimensional state spaces, the Kalman filter (linear-Gaussian models) or particle filters (nonlinear / non-Gaussian models) are standard. Variational methods trade accuracy for scalability in very large models.
What is the difference between filtering and smoothing in a DBN?
Filtering computes P(X_t | observations up to t) online as data arrive. Smoothing revises past beliefs using all available data, computing P(X_t | all observations); it is an offline operation that typically produces lower-variance estimates but requires the full sequence in advance.
Can I learn the structure of a DBN from data?
Yes, but it is difficult. Score-based algorithms (e.g. BIC-penalised likelihood) or constraint-based methods can search over graph structures. In practice, domain knowledge is used to constrain the search, and the learned structure should be validated against held-out sequences.
Sources
- Dean, T. & Kanazawa, K. (1989). A model for reasoning about persistence and causation. Computational Intelligence, 5(3), 142–150. DOI: 10.1111/j.1467-8640.1989.tb00324.x ↗
- Murphy, K. P. (2002). Dynamic Bayesian Networks: Representation, Inference and Learning. PhD thesis, University of California, Berkeley. link ↗
How to cite this page
ScholarGate. (2026, June 3). Dynamic Bayesian Network. ScholarGate. https://scholargate.app/en/bayesian/dynamic-bayesian-network
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bayesian NetworkBayesian↔ compare
- Hierarchical Bayesian InferenceBayesian↔ compare
- Kalman FilterBayesian↔ compare
- Particle FilterBayesian↔ compare
- Sequential Monte CarloBayesian↔ compare