3 search results - page 1 / 1 » Large-Sample Learning of Bayesian Networks is NP-Hard |
UAI
2003
13 years 6 months ago
2003
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
JMLR
2002
13 years 4 months ago
2002
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...