Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
type: Item
instance of: scholarly article
title: Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis
author: Niels Grüttemeier
author: Christian Komusiewicz
published in: Journal of Artificial Intelligence Research
publication date: 2022-08-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/2004.14724
Mathematics Subject Classification ID: 68Txx
zbMATH DE Number: 7566011
zbMATH Keywords: Bayesian networks
zbMATH Keywords: machine learning
zbMATH Keywords: mathematical foundations
MaRDI profile type: Publication
OpenAlex ID: W3022932996
cites work: Color-coding
cites work: Kernel bounds for disjoint cycles and disjoint paths
cites work: Approximating discrete probability distributions with dependence trees
cites work: The computational complexity of probabilistic inference using Bayesian belief networks
cites work: Parameterized Algorithms
cites work: Modeling and Reasoning with Bayesian Networks
cites work: Q4850549
cites work: Q3096212
cites work: On the parameterized complexity of multiple-interval graph problems
cites work: On finding optimal polytrees
cites work: On the relation of strong triadic closure and cluster deletion
cites work: On the Complexity of General Graph Factor Problems
cites work: Q4533364
cites work: Q4231923
cites work: Parameterized Complexity Results for Exact Bayesian Network Structure Learning
cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
DOI: 10.1613/JAIR.1.13138
description: scientific article; zbMATH DE number 7566011