Parameterized Complexity Results for Exact Bayesian Network Structure Learning

Bayesian network structure learning is the notoriously difficult problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian network structure learning under graph theoretic restric...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Ordyniak, Sebastian, Szeider, Stefan
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 04.02.2014
Subjects:	Bayesian analysis Complexity Constrictions Evidence Graph theory Machine learning Optimization Polynomials
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!