Polynomial-Time Algorithm for Learning Optimal BFS-Consistent Dynamic Bayesian Networks
Dynamic Bayesian networks (DBN) are powerful probabilistic representations that model stochastic processes. They consist of a prior network, representing the distribution over the initial variables, and a set of transition networks, representing the transition distribution between variables over tim...
Main Authors: | Margarida Sousa, Alexandra M. Carvalho |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-04-01
|
Series: | Entropy |
Subjects: | |
Online Access: | http://www.mdpi.com/1099-4300/20/4/274 |
Similar Items
-
Outlier Detection for Multivariate Time Series Using Dynamic Bayesian Networks
by: Jorge L. Serras, et al.
Published: (2021-02-01) -
The Comparison of the Equated Tests Scores by Various Covariates using Bayesian Nonparametric Model
by: Meltem YURTÇU, et al.
Published: (2021-06-01) -
Justifying Objective Bayesianism on Predicate Languages
by: Jürgen Landes, et al.
Published: (2015-04-01) -
Objective Bayesianism and the Maximum Entropy Principle
by: Jon Williamson, et al.
Published: (2013-09-01) -
Bayesian Estimation of Combined Accuracy for Tests with Verification Bias
by: Lyle D. Broemeling
Published: (2011-12-01)