Learning Bayesian Networks is NP-Complete
Algorithms for learning Bayesian networks from data have two components: a scoring metric and a search procedure. The scoring metric computes a score reflecting the goodness-of-fit of the structure to the data. The search procedure tries to identify network structures with high scores. Heckerman et al. (1995) introduce a Bayesian metric, called the BDe metric, that computes the relative posterior probability of a network structure given data. In this paper, we show that the search problem of identifying a Bayesian network—among those where each node has at most K parents—that has a relative posterior probability greater than a given constant is NP-complete, when the BDe metric is used.
Unable to display preview. Download preview PDF.
- [Chickering, 1995]Chickering, D. M. (1995). A Transformational characterization of Bayesian network structures. In Proceedings of Eleventh Conference on Uncertainty in Artificial Intelligence,Montreal, QU. Morgan Kaufman.Google Scholar
- [Cooper and Herskovits, 1992]
- [Garey and Johnson, 1979]
- [Garvil, 1977]Garvil, F. (1977). Some NP-complete problems on graphs. In Proc. 11th Conf. on Information Sciences and Systems, Johns Hopkins University, pages 91–95. Baltimore, MD.Google Scholar
- [Heckerman et al., 1995]
- [Höffgen, 1993]Höffgen, K. (revised 1993 ). Learning and robust learning of product dis- tributions. Technical Report 464, Fachbereich Informatik, Universität Dortmund.Google Scholar