tDBN 0.1.4 – Polynomial-time algorithm for Learning optimal Tree-augmented Dynamic Bayesian Networks

tDBN 0.1.4

:: DESCRIPTION

tDBN is Java implementation of a dynamic Bayesian network (DBN) structure learning algorithm with the same name. It can learn a network structure from a file with multivariate longitudinal observations, and has polynomial time complexity in the number of attributes and observations.

Advertisement

::DEVELOPER

Systems Biomedicine

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux / MacOs/ Windows
  • Java

:: DOWNLOAD

tDBN

:: MORE INFORMATION

Citation

Sousa M, Carvalho AM.
Polynomial-Time Algorithm for Learning Optimal BFS-Consistent Dynamic Bayesian Networks.
Entropy (Basel). 2018 Apr 12;20(4):274. doi: 10.3390/e20040274. PMID: 33265365; PMCID: PMC7512791.

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Exit mobile version