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...

Celý popis

Podrobná bibliografia

Vydané v:	The Journal of artificial intelligence research Ročník 46; s. 263 - 302
Hlavní autori:	Ordyniak, S., Szeider, S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	San Francisco AI Access Foundation 01.01.2013
Predmet:	Artificial intelligence Bayesian analysis Complexity Constrictions Graph theory Machine learning Optimization Polynomials
ISSN:	1076-9757, 1076-9757, 1943-5037
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!