Skip to main content

Exploring the Noisy Threshold Function in Designing Bayesian Networks

  • Conference paper

Abstract

Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. Many Bayesian network models incorporate causal independence assumptions; however, only the noisy OR and noisy AND, two examples of causal independence models, are used in practice. Their underlying assumption that either at least one cause, or all causes together, give rise to an effect, however, seems unnecessarily restrictive. In the present paper a new, more flexible, causal independence model is proposed, based on the Boolean threshold function. A connection is established between conditional probability distributions based on the noisy threshold model and Poisson binomial distributions, and the basic properties of this probability distribution are studied in some depth. The successful application of the noisy threshold model in the refinement of a Bayesian network for the diagnosis and treatment of ventilator-associated pneumonia demo nstrates the practical value of the presented theory.

This research was supported by the Netherlands Organization for Scientific Research (NWO).

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. van Beek, An application of Fourier methods to the problem of sharpening the Berry-Essen inequality. Z. Wahrscheinlichkeitstheorie verw. Gebiete, 23:187–196, 1972.

    Article  MATH  Google Scholar 

  2. J. Darroch, On the distribution of the number of successes in independent trials. The Annals of Mathematical Statistics, 35:1317–1321, 1964.

    Article  MATH  MathSciNet  Google Scholar 

  3. A.W.P. Edwards, The Meaning of Binomial Distribution. Nature 186, 1074, 1960.

    Article  MATH  Google Scholar 

  4. H.B. Enderton, A Mathematical Introduction to Logic. Academic Press, San Diego, 1972.

    MATH  Google Scholar 

  5. W. Feller, An Introduction to Probability Theory and Its Applications. John Wiley, 1968.

    Google Scholar 

  6. D. Heckerman, Causal independence for knowledge acquisition and inference. Proceedings of the Ninth Conference on Uncertainty in Artificial Intelligence, 122–127, 1993.

    Google Scholar 

  7. K. Jogdeo and S.M. Samuels, Monotone convergence of binomial probabilities and a generalization of Ramanujan’s equation. The Annals of Mathematical Statistics, 39:1191–1195, 1968.

    Article  MATH  Google Scholar 

  8. R. Jurgelenaite and P.J.F. Lucas, Exploiting causal independence in large Bayesian networks. Knowledge-Based Systems Journal, 18:153–162, 2005.

    Article  Google Scholar 

  9. S. Kullback and R.A. Leibler, On information and sufficiency. The Annals of Mathematical Statistics, 22:79–86, 1951.

    Article  MATH  MathSciNet  Google Scholar 

  10. L. Le Cam, An approximation theorem for the Poisson binomial distribution. Pacific Journal of Mathematics, 10: 1181–1197, 1960.

    MATH  MathSciNet  Google Scholar 

  11. P.J.F. Lucas, N.C. de Bruijn, K. Schurink and I.M. Hoepelman, A probabilistic and decision-theoretic approach to the management of infectious disease at the ICU. Artificial Intelligence in Medicine, 19:251–279, 2000.

    Article  Google Scholar 

  12. P.J.F. Lucas, Bayesian network modelling through qualitative patterns. Artificial Intelligence, 163: 233–263, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Pitman, Probabilistic bounds on the coefficients of polynomials with only real zeros. Journal of Combinatorial Theory, Series A, 77:279–303, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  14. B. Roos, Binomial approximation to the Poisson binomial distribution: the Krawtchouk expansion. Theory of Probability and Its Applications, 45:258–272, 2001.

    Article  MathSciNet  Google Scholar 

  15. I. Wegener, The Complexity of Boolean Functions. John Wiley & Sons, New York, 1987.

    MATH  Google Scholar 

  16. N.L. Zhang and D. Poole, Exploiting causal independence in Bayesian networks inference. Journal of Artificial Intelligence Research, 5:301–328, 1996.

    MATH  MathSciNet  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 London Limited

About this paper

Cite this paper

Jurgelenaite, R., Lucas, P., Heskes, T. (2006). Exploring the Noisy Threshold Function in Designing Bayesian Networks. In: Bramer, M., Coenen, F., Allen, T. (eds) Research and Development in Intelligent Systems XXII. SGAI 2005. Springer, London. https://doi.org/10.1007/978-1-84628-226-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-226-3_11

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-225-6

  • Online ISBN: 978-1-84628-226-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics