Learning Bayesian Networks Does Not Have to Be NP-Hard

DOI10.1007/11821069_27zbMath1132.68537OpenAlexW1534556330MaRDI QIDQ5756678

Norbert Dojer

Publication date: 5 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11821069_27

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational methods for problems pertaining to biology (92-08)

Related Items (3)

Learning Bayesian networks from datasets joining continuous and discrete variables ⋮ Bayesian network models for incomplete and dynamic data ⋮ Autoregressive models for gene regulatory network inference: sparsity, stability and causality issues

This page was built for publication: Learning Bayesian Networks Does Not Have to Be NP-Hard