Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
From MaRDI portal
Publication:5094064
DOI10.1613/JAIR.1.13138OpenAlexW3022932996MaRDI QIDQ5094064FDOQ5094064
Authors: Niels Grüttemeier, Christian Komusiewicz 
Publication date: 2 August 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14724
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
- Approximating discrete probability distributions with dependence trees
- Title not available (Why is that?)
- Modeling and Reasoning with Bayesian Networks
- On the Complexity of General Graph Factor Problems
- Title not available (Why is that?)
- Color-coding
- Parameterized algorithms
- Title not available (Why is that?)
- 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
- Kernel bounds for disjoint cycles and disjoint paths
- The computational complexity of probabilistic inference using Bayesian belief networks
- Parameterized complexity results for exact Bayesian network structure learning
- On finding optimal polytrees
- On the relation of strong triadic closure and cluster deletion
- Title not available (Why is that?)
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)
