Skip to main content

Abstract

Complexity has many facets as does any general concept. The relationship between “infinitely” complex reality and restricted complexity of the artificial world of models is addressed. Particularly, the paper tries to clarify the meaning of Bayesian identification under mismodelling by answering the question, “What is the outcome of the Bayesian identification without supposing the model set considered contains the ”true“ system model?”

The answer relates known asympotic results to the “natural” finite-time domain of Bayesian paradigm. It serves as an interpretation “smoother” of those Bayesian identification results that quietly ignore the mismodelling present.

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. M. Kárný, Estimation of control period for selftuners, Automatica, vol. 27, no. 2, pp. 339–348, 1991, extended version of the paper presented at 11th IFAC World Congress, Tallinn.

    Article  MathSciNet  MATH  Google Scholar 

  2. R. Kulhavý, A Kullback-Leibler distance approach to system identification, in Preprints of the IFAC Symposium on Adaptive Systems in Control and Signal Processing, Cs. Bányász, Ed., pp. 55–66. Budapest, 1995.

    Google Scholar 

  3. P.H. Algoet, T.M. Cover, A sandwich proof fo the Shannon-McMillanBreiman theorem, The Annals of Probability, vol. 16, pp. 899–909, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  4. V. Peterka, Bayesian Approach to System Identification, in Trends and Progress in System Identification, P. Eykhoff, Ed., pp. 239–304. Pergamon Press, 1981.

    Google Scholar 

  5. T.L. Fine, Theories of Probability, Academic Press, New York, London, 1973.

    MATH  Google Scholar 

  6. M.M. Rao, Measure Theory and Integration, John Wiley & Sons, New York, 1987.

    MATH  Google Scholar 

  7. L. Berec, On Model Structure Identification (A unifying view and a particular example), in Preprints of the Workshop CMP’96, L. Berec, J. Rojíček, M. Kárný, K. Warwick, Eds., pp. 121–128. Prague, 1996.

    Google Scholar 

  8. L. LjungSystem Identification: Theory for the User, Prentice-Hall, 1987.

    MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media New York

About this chapter

Cite this chapter

Berec, L., Kárný, M. (1997). Identification of Reality in Bayesian Context. In: Kárný, M., Warwick, K. (eds) Computer Intensive Methods in Control and Signal Processing. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-1996-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-1996-5_10

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-7373-8

  • Online ISBN: 978-1-4612-1996-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics