Approximate Learning of High Dimensional Bayesian Network Structures via Pruning of Candidate Parent Sets

Score-based algorithms that learn Bayesian Network (BN) structures provide solutions ranging from different levels of approximate learning to exact learning. Approximate solutions exist because exact learning is generally not applicable to networks of moderate or higher complexity. In general, appro...

Descripción completa

Detalles Bibliográficos
Autores principales: Guo, Zhigao, Constantinou, Anthony C.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597292/
https://www.ncbi.nlm.nih.gov/pubmed/33286911
http://dx.doi.org/10.3390/e22101142

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597292/
https://www.ncbi.nlm.nih.gov/pubmed/33286911
http://dx.doi.org/10.3390/e22101142

Ejemplares similares