Skip to main content
SpringerLink
Log in

The Problem of Finding the Sparsest Bayesian Network for an Input Data Set is NP-Hard

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2012)

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

Included in the following conference series:

Abstract

We show that the problem of finding a Bayesian network with minimum number of edges for an input data set is NP-hard. We discuss the analogies of formulation and proof of our result to other studies in the areas of Bayesian networks and knowledge discovery.

This work was partially supported by the Polish National Science Centre grant 2011/01/B/ST6/03867.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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.

Similar content being viewed by others

References

  1. Chickering, D.M.: Learning Bayesian Networks is NP-Complete. In: Fisher, D., Lenz, H. (eds.) Learning from Data: Artificial Intelligence and Statistics V, pp. 121–130. Springer (1996)

    Google Scholar 

  2. Chickering, D.M.: Optimal Structure Identification with Greedy Search. Journal of Machine Learning Research 3, 507–554 (2002)

    MathSciNet  Google Scholar 

  3. Chickering, D.M., Heckerman, D., Meek, C.: Large-sample Learning of Bayesian Networks is NP-Hard. The Journal of Machine Learning Research 5, 1287–1330 (2004)

    MathSciNet  MATH  Google Scholar 

  4. Cooper, F.G., Herskovits, E.: A Bayesian Method for the Induction of Probabilistic Networks from Data. Machine Learning 9, 309–347 (1992)

    MATH  Google Scholar 

  5. Jensen, F.V.: Bayesian Networks and Decision Graphs. Statistics for Engineering and Information Science. Springer (2001)

    Google Scholar 

  6. Kloesgen, W., Żytkow, J.M. (eds.): Handbook of Data Mining and Knowledge Discovery. Oxford University Press (2002)

    Google Scholar 

  7. Neapolitan, R.: Learning Bayesian Networks. Prentice Hall (2004)

    Google Scholar 

  8. Pawlak, Z., Skowron, A.: Rudiments of Rough Sets. Information Sciences 177(1), 3–27 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  9. Pearl, J.: Bayesian Networks: A Model of Self-activated Memory for Evidential Reasoning. In: Proc. of the 7th Conf. of the Cognitive Science Society, pp. 329–334. University of California, Irvine (1985)

    Google Scholar 

  10. Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988)

    Google Scholar 

  11. Savnik, I., Flach, P.A.: Discovery of Multivalued Dependencies from Relations. Intell. Data Anal. 4(3-4), 195–211 (2000)

    MATH  Google Scholar 

  12. Shenoy, P.P.: Conditional Independence in Valuation-based Systems. International Journal of Approximate Reasoning 10, 203–234 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  13. Ślęzak, D.: Approximate Entropy Reducts. Fundamenta Informaticae 53(3-4), 365–390 (2002)

    MathSciNet  Google Scholar 

  14. Ślęzak, D.: Degrees of Conditional (In)dependence: A Framework for Approximate Bayesian Networks and Examples Related to the Rough Set-based Feature Selection. Information Sciences 179(3), 197–209 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ślęzak, D.: Rough Sets and Functional Dependencies in Data: Foundations of Association Reducts. In: Gavrilova, M.L., Tan, C.J.K., Wang, Y., Chan, K.C.C. (eds.) Transactions on Computational Science V. LNCS, vol. 5540, pp. 182–205. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  16. Studeny, M.: Probabilistic Conditional Independence Structures. Springer (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, University of Warsaw, Banacha 2, 02-097, Warsaw, Poland

    Paweł Betliński & Dominik Ślęzak

  2. Infobright Inc., Krzywickiego 34 pok. 219, 02-078, Warsaw, Poland

    Dominik Ślęzak

Authors
  1. Paweł Betliński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dominik Ślęzak
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Hong Kong Baptist University, 224 Waterloo Road, Kowloon, Hong Kong

    Li Chen  & Jiming Liu  & 

  2. Institute for Software Technology, Graz University of Technology, Inffeldgasse 16b, 8010, Graz, Austria

    Alexander Felfernig

  3. University of North Carolina, Charlotte, NC 28223, USA and Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Betliński, P., Ślęzak, D. (2012). The Problem of Finding the Sparsest Bayesian Network for an Input Data Set is NP-Hard. In: Chen, L., Felfernig, A., Liu, J., Raś, Z.W. (eds) Foundations of Intelligent Systems. ISMIS 2012. Lecture Notes in Computer Science(), vol 7661. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34624-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34624-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34623-1

  • Online ISBN: 978-3-642-34624-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation