Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
From MaRDI portal
Recommendations
- Parameterized complexity results for exact Bayesian network structure learning
- Learning Bayesian Networks Does Not Have to Be NP-Hard
- Large-sample learning of Bayesian networks is NP-hard
- Optimal search on clustered structural constraint for learning Bayesian network structure
- Efficient structure learning of Bayesian networks using constraints
Cites work
- scientific article; zbMATH DE number 5968954 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 1753154 (Why is no real title available?)
- scientific article; zbMATH DE number 806748 (Why is no real title available?)
- Approximating discrete probability distributions with dependence trees
- Color-coding
- Kernel bounds for disjoint cycles and disjoint paths
- Modeling and Reasoning with Bayesian Networks
- On finding optimal polytrees
- On the Complexity of General Graph Factor Problems
- On the parameterized complexity of multiple-interval graph problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- Parameterized algorithms
- Parameterized complexity results for exact Bayesian network structure learning
- The computational complexity of probabilistic inference using Bayesian belief networks
Cited in
(3)
This page was built for publication: Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094064)
