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:	The Journal of artificial intelligence research Vol. 46; pp. 263 - 302
Main Authors:	Ordyniak, S., Szeider, S.
Format:	Journal Article
Language:	English
Published:	San Francisco AI Access Foundation 01.01.2013
Subjects:	Artificial intelligence Bayesian analysis Complexity Constrictions Graph theory Machine learning Optimization Polynomials
ISSN:	1076-9757, 1076-9757, 1943-5037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!