Parameterized Complexity Results for Exact Bayesian Network Structure Learning

DOI10.1613/jair.3744zbMath1272.68344arXiv1402.0558OpenAlexW1702884067MaRDI QIDQ4913753

Stefan Szeider, Sebastian Ordyniak

Publication date: 9 April 2013

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.0558

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Graphical methods in statistics (62A09)

Related Items (5)

Objective Bayesian Nets for Integrating Consistent Datasets ⋮ Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis ⋮ Maximizing Social Welfare in Score-Based Social Distance Games ⋮ Searching for better fill-in ⋮ On finding optimal polytrees

This page was built for publication: Parameterized Complexity Results for Exact Bayesian Network Structure Learning