CausNet: generational orderings based search for optimal Bayesian networks via dynamic programming with parent set constraints

BACKGROUND: Finding a globally optimal Bayesian Network using exhaustive search is a problem with super-exponential complexity, which severely restricts the number of variables that can feasibly be included. We implement a dynamic programming based algorithm with built-in dimensionality reduction an...

Descripción completa

Detalles Bibliográficos
Autores principales: Sharma, Nand, Millstein, Joshua
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2023
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9926787/
https://www.ncbi.nlm.nih.gov/pubmed/36788490
http://dx.doi.org/10.1186/s12859-023-05159-6

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9926787/
https://www.ncbi.nlm.nih.gov/pubmed/36788490
http://dx.doi.org/10.1186/s12859-023-05159-6

Ejemplares similares