Identification from Noisy Examples

  • Philip D. Laird
Part of the The Kluwer International Series in Engineering and Computer Sciences book series (SECS, volume 47)

Abstract

When some of the training examples may be incorrect, none of the foregoing identification strategies are effective:
  • With algorithms based on identification by enumeration (including refinement algorithms), an incorrect example may cause a correct hypothesis to be discarded. Even if correct hypotheses occur infinitely often in the enumeration, errors can cause them to be discarded infinitely often, and thereby frustrate convergence.

  • With pac-identification, the fundamental strategy of choosing a hypothesis consistent with the examples may fail, because there may be no such hypothesis.

Keywords

Assure Bark Dition 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1988

Authors and Affiliations

  • Philip D. Laird
    • 1
  1. 1.NASA Ames Research CenterUSA

Personalised recommendations