Abstract
In this chapter and the next, we shall adopt a different model of identification in order to focus on two of the weaknesses of the preceding theory: the lack of robustness, and the lack of a complexity measure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1988 Kluwer Academic Publishers
About this chapter
Cite this chapter
Laird, P.D. (1988). Probabilistic Approximate Identification. In: Learning from Good and Bad Data. The Kluwer International Series in Engineering and Computer Sciences, vol 47. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1685-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1685-5_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8951-7
Online ISBN: 978-1-4613-1685-5
eBook Packages: Springer Book Archive