Advertisement

Learning Bayesian Networks Does Not Have to Be NP-Hard

  • Norbert Dojer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4162)

Abstract

We propose an algorithm for learning an optimal Bayesian network from data. Our method is addressed to biological applications, where usually datasets are small but sets of random variables are large. Moreover we assume that there is no need to examine the acyclicity of the graph.

We provide polynomial bounds (with respect to the number of random variables) for time complexity of our algorithm for two generally used scoring criteria: Minimal Description Length and Bayesian-Dirichlet equivalence.

Keywords

Bayesian Network Optimal Network Minimal Description Length Dynamic Bayesian Network Bayesian Belief Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chickering, D.M.: Learning Bayesian networks is NP-complete. In: Fisher, D., Lenz, H.J. (eds.) Learning from Data: Artificial Inteligence and Statistics V. Springer, Heidelberg (1996)Google Scholar
  2. 2.
    Chickering, D.M., Heckerman, D., Meek, C.: Large-sample learning of Bayesian networks is NP-hard. Journal of Machine Learning Research 5, 1287–1330 (2004)MathSciNetGoogle Scholar
  3. 3.
    Dasgupta, S.: Learning polytrees. In: Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence (UAI 1999), pp. 134–141. Morgan Kaufmann Publishers, San Francisco (1999)Google Scholar
  4. 4.
    Meek, C.: Finding a path is harder than finding a tree. J. Artificial Intelligence Res. 15, 383–389 (2001) (electronic)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Ott, S., Imoto, S., Miyano, S.: Finding optimal models for small gene networks. In: Pac. Symp. Biocomput., pp. 557–567 (2004)Google Scholar
  6. 6.
    Heckerman, D., Geiger, D., Chickering, D.M.: Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning 20(3), 197–243 (1995)zbMATHGoogle Scholar
  7. 7.
    Neapolitan, R.E.: Learning Bayesian Networks. Prentice-Hall, Englewood Cliffs (2003)Google Scholar
  8. 8.
    Friedman, N., Murphy, K., Russell, S.: Learning the structure of dynamic probabilistic networks. In: Cooper, G.F., Moral, S. (eds.) Proceedings of the Fourteenth Conference on Uncertainty in Artificial Inteligence, pp. 139–147 (1998)Google Scholar
  9. 9.
    Lam, W., Bacchus, F.: Learning Bayesian belief networks: An approach based on the MDL principle. Computational Intelligence 10(3), 269–293 (1994)CrossRefGoogle Scholar
  10. 10.
    Cooper, G.F., Herskovits, E.: A Bayesian method for the induction of probabilistic networks from data. Machine Learning 9, 309–347 (1992)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Norbert Dojer
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityWarszawaPoland

Personalised recommendations