Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis

DOI10.1613/JAIR.1.13138OpenAlexW3022932996MaRDI QIDQ5094064FDOQ5094064

Christian Komusiewicz, Niels Grüttemeier

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

zbMATH Keywords

machine learningBayesian networksmathematical foundations

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

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)

• Automatically finding the right probabilities in Bayesian networks
• Title not available (Why is that?)
• The complexity of optimizing atomic congestion

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)