Abstract
Having presented the fundamental concepts and some elementary algorithms for identification using refinements, we now need to know how to use refinements in more sophisticated ways. The paradigmatic situation is that we are faced with constructing an identification program on an unfamiliar domain. Armed with the ideas of the previous chapter, we should
-
1.
select a representation ε for the class of target objects D, and the mapping h that relates them.
-
2.
prepare an ordering ≽ on ε that relates to the ordering ≥ D on as closely as possible and which is preserved by h.
-
3.
construct a refinement ρ and/or γ for the ordering.
-
4.
plug these into a nifty, all-purpose algorithm for indentification.
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). How to Work With Refinements. 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_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1685-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8951-7
Online ISBN: 978-1-4613-1685-5
eBook Packages: Springer Book Archive