Dynamic Programming BN Structure Learning Algorithm Integrating Double Constraints under Small Sample Condition

The Bayesian Network (BN) structure learning algorithm based on dynamic programming can obtain global optimal solutions. However, when the sample cannot fully contain the information of the real structure, especially when the sample size is small, the obtained structure is inaccurate. Therefore, thi...

Descripción completa

Detalles Bibliográficos
Autores principales: Lv, Zhigang, Chen, Yiwei, Di, Ruohai, Wang, Hongxi, Sun, Xiaojing, He, Chuchao, Li, Xiaoyan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601758/
https://www.ncbi.nlm.nih.gov/pubmed/37420374
http://dx.doi.org/10.3390/e24101354

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9601758/
https://www.ncbi.nlm.nih.gov/pubmed/37420374
http://dx.doi.org/10.3390/e24101354

Ejemplares similares