Skip to main content

Modeling Causal Reinforcement and Undermining with Noisy-AND Trees

  • Conference paper
Advances in Artificial Intelligence (Canadian AI 2006)

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

Abstract

When data are insufficient to support learning, causal modeling, such as noisy-OR, aids elicitation by reducing probability parameters to be acquired in constructing a Bayesian network. Multiple causes can reinforce each other in producing the effect or can undermine the impact of each other. Most existing causal models do not consider their interactions from the perspective of reinforcement or undermining. We show that none of them can represent both interactions. We present the first explicit causal model that can encode both reinforcement and undermining and we show how to use such a model to support efficient probability elicitation.

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 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.

References

  1. Diez, F.J.: Parameter adjustment in Bayes networks: The generalized noisy or-gate. In: Heckerman, D., Mamdani, A. (eds.) Proc. 9th Conf. on Uncertainty in Artificial Intelligence, pp. 99–105. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  2. Galan, S.F., Diez, F.J.: Modeling dynamic causal interactiosn with Bayesian networks: temporal noisy gates. In: Proc. 2nd Inter. Workshop on Causal Networks, pp. 1–5 (2000)

    Google Scholar 

  3. Heckerman, D.: Causal independence for knowledge acquisition and inference. In: Heckerman, D., Mamdani, A. (eds.) Proc. 9th Conf. on Uncertainty in Artificial Intelligence, pp. 122–127. Morgan Kaufmann, San Francisco (1993)

    Google Scholar 

  4. Heckerman, D., Breese, J.S.: Causal independence for probabilistic assessment and inference using Bayesian networks. IEEE Trans. on System, Man and Cybernetics 26(6), 826–831 (1996)

    Article  Google Scholar 

  5. Henrion, M.: Some practical issues in constructing belief networks. In: Kanal, L.N., Levitt, T.S., Lemmer, J.F. (eds.) Uncertainty in Artificial Intelligence 3, pp. 161–173. Elsevier Science Publishers, Amsterdam (1989)

    Google Scholar 

  6. Lemmer, J.F., Gossink, D.E.: Recursive noisy OR - a rule for estimating complex probabilistic interactions. IEEE SMC, Part B 34(6), 2252–2261 (2004)

    Google Scholar 

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

    Google Scholar 

  8. Pearl, J.: Causality: Models, Reasoning, and Inference. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  9. Srinivas, S.: A generalization of noisy-or model. In: Heckerman, D., Mamdani, A. (eds.) Proc. 9th Conf. on Uncertainty in Artificial Intelligence, pp. 208–215. Morgan Kaufmann, San Francisco (1993)

    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

Xiang, Y., Jia, N. (2006). Modeling Causal Reinforcement and Undermining with Noisy-AND Trees. In: Lamontagne, L., Marchand, M. (eds) Advances in Artificial Intelligence. Canadian AI 2006. Lecture Notes in Computer Science(), vol 4013. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11766247_15

Download citation

  • DOI: https://doi.org/10.1007/11766247_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34628-9

  • Online ISBN: 978-3-540-34630-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics