Skip to main content

Propagation in Inferenznetzen unter Berücksichtigung des Prinzips der minimalen relativen Entropie

  • Conference paper
DGOR / ÖGOR

Part of the book series: Operations Research Proceedings 1992 ((ORP,volume 1992))

  • 261 Accesses

Kurzfassung

In diesem Artikel wird ein Algorithmus angegeben, mit dem die Propagation in einem Inferenznetz unter Ausnutzung des Prinzips der minimalen relativen Entropie effizient durchgeführt werden kann. Hierzu wird auf ein aus der Statistik bekanntes Verfahren zurückgegriffen, das auf die hier behandelte Problemstellung modifiziert angewendet werden kann.

Abstract

In this paper we present an algorithm which allows efficient updating of an arbitrary LEG-Net with respect to the principle of minimum relative entropy. We use a well known Statistical method, which will be modified due to our problem definition.

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

Literatur

  1. Goldman, S.A.; Rivest, R.L. A Non-iterative Maximum Entropy Algorithm, in: Uncertainty in Artificial Intelligence 2, North-Holland, p 133–48, 1988

    Google Scholar 

  2. Ireland, C.T.; Kullback, S. Contingency tables with given marginals in: Biometrika, 55, l,pp. 179–88, 1968

    Article  Google Scholar 

  3. Lauritzen, S.L. Lectures on Contingency Tables 2nd ed. Aalborg University Press, 1982

    Google Scholar 

  4. Lauritzen, S.L.; Spiegelhalter, D.J. Local computations with probabilities on graphical structures and their applications to expert systems, in: Readings in Uncertain Reasoning, Morgan Kaufmann Publishers, Inc, 1990

    Google Scholar 

  5. Lemmer, J.F; Barth, S.W.; Generalized Bayesian Updating of incompletely specified distributions, in: Large Scale Systems 5, pp. 51–68, 1983

    Google Scholar 

  6. Malvestuto, F.M. Decomposing complex contingency tables to reduce storage requirements, in Proc., 3rd Intern. Workshop on Scientific and Statistical Database Management, pp. 66–71, 1986

    Google Scholar 

  7. Shore, J.E.; Johnson, R.W. Axiomatic Derivation of the Principle of Maximum Entropy and the Principle of Minimum Cross Entropy, in: IEEE Trans. Inform. Theory IT-26, 1, pp. 26–37, 1980

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Heidelberg

About this paper

Cite this paper

Meyer, CH., Rödder, W. (1993). Propagation in Inferenznetzen unter Berücksichtigung des Prinzips der minimalen relativen Entropie. In: Hansmann, KW., Bachem, A., Jarke, M., Katzenberger, W.E., Marusev, A. (eds) DGOR / ÖGOR. Operations Research Proceedings 1992, vol 1992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78196-4_127

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-78196-4_127

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56642-7

  • Online ISBN: 978-3-642-78196-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics