Skip to main content

A New Polynomial Time Algorithm for Bayesian Network Structure Learning

  • Conference paper
Advanced Data Mining and Applications (ADMA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4093))

Included in the following conference series:

Abstract

We propose a new algorithm called SCD  for learning the structure of a Bayesian network. The algorithm is a kind of constraint-based algorithm. By taking advantage of variable ordering, it only requires polynomial time conditional independence tests and learns the exact structure theoretically. A variant which adopts the Bayesian Dirichlet scoring function is also presented for practical purposes. The performance of the algorithms are analyzed in several aspects and compared with other existing algorithms. In addition, we define a new evaluation metric named EP power  which measures the proportion of errors caused by previously made mistakes in the learning sequence, and use the metric for verifying the robustness of the proposed algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pearl, J.: Fusion, propagation and structuring in belief networks. In: Kanal, Lemmer (eds.) Uncertainty in Artificial Intelligence, pp. 357–370. North-Holland, Amsterdam (1986)

    Google Scholar 

  2. Spirtes, P., Glymour, C., Scheines, R., Kauffman, S., Aimale, V., Wimberly, F.: Constructing bayesian network models of gene expression networks from microarray data. In: Proceedings of the Atlantic Symposium on Computational Biology, Genome Information Systems and Technology (2001)

    Google Scholar 

  3. Cooper, G.F., Herskovits, E.: A bayesian method for the induction of probabilistic networks from data. Machine Learning 9, 309–347 (1992)

    MATH  Google Scholar 

  4. Spirtes, P., Glymour, C., Scheines, R.: Causation, Prediction, and Search. Springer, Heidelberg (1993)

    Book  MATH  Google Scholar 

  5. Pearl, J., Verma, T.S.: A theory of inferred causation. In: Allen, J.F., Fikes, R., Sandewall, E. (eds.) KR 1991: Principles of Knowledge Representation and Reasoning, San Mateo, California, pp. 441–452. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  6. Cheng, J., Greiner, R., Kelly, J., Bell, D.A., Liu, W.: Learning bayesian networks from data: An information-theory based approach. Artif. Intell. 137(1-2), 43–90 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Heckerman, D.: A tutorial on learning bayesian networks. Tech. Rep. MSR-95-06, Microsoft Research (1995)

    Google Scholar 

  8. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Mateo, California (1988)

    Google Scholar 

  9. Pearl, J.: Causality: Modeling, Reasoning, and Inference. Cambridge University Press, Cambridge (2000)

    Google Scholar 

  10. Roulston, M.S.: Estimating the errors on measured entropy and mutual information. Physica D: Nonlinear Phenomena 125, 285–294 (1999)

    Article  MATH  Google Scholar 

  11. Ide, J.S., Cozman, F.G., Ramos, F.T.: Generating random bayesian networks with constraints on induced width. In: de Mántaras, R.L., Saitta, L. (eds.) ECAI, pp. 323–327. IOS Press, Amsterdam (2004)

    Google Scholar 

  12. Beinlich, I., Suermondt, H., Chavez, R., Cooper, G.: The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks. In: Proceedings of the Second European Conference on Artificial Intelligence in Medicine, London, pp. 247–256 (1989)

    Google Scholar 

  13. Hsu, W.H.: Genetic wrappers for feature selection in decision tree induction and variable ordering in bayesian network structure learning. Inf. Sci. 163(1-3), 103–122 (2004)

    Article  Google Scholar 

  14. Steck, H.: Constraint-Based Structural Learning in Bayesian Networks using Finite Data Sets. PhD thesis, Munich University of Technology (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, S., Yang, J., Park, S. (2006). A New Polynomial Time Algorithm for Bayesian Network Structure Learning. In: Li, X., Zaïane, O.R., Li, Z. (eds) Advanced Data Mining and Applications. ADMA 2006. Lecture Notes in Computer Science(), vol 4093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11811305_55

Download citation

  • DOI: https://doi.org/10.1007/11811305_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37025-3

  • Online ISBN: 978-3-540-37026-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics