![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Book
-
Chapter
Identification by Refinement
We have seen that many identification procedures work by choosing a hypothesis and then generalizing or specializing it in response to counterexamples. We shall now formalize this idea. The key concept is that...
-
Chapter
Probabilistic Approximate Identification
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.
-
Chapter
Conclusions
Let us summarize briefly the results presented in this dissertation, with an emphasis on how they related to one another. The model of the identification problem introduced in Chapter One has been used through...
-
Chapter
The Identification Problem
This chapter introduces the identification problem and reviews some of the ways it has been studied in the literature. We offer a formal definition for the identification problem and present a familiar, but fu...
-
Chapter
How to Work With Refinements
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 ...
-
Chapter
Identification from Noisy Examples
When some of the training examples may be incorrect, none of the foregoing identification strategies are effective:
With algorithms based on identification by enumeration (...