The Candidate-Elimination Algorithm: Emulation and Extensions

  • Haym Hirsh
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 104)


This chapter describes how the original version space approach (assuming strict consistency with data) is subsumed by the generalized approach, and in particular, how the candidate-elimination algorithm can be accomplished with incremental version-space merging. This serves as the first test of the generality of incremental version-space merging—that it maintains the functionality of the original version-space approach.


Version Space Training Instance Positive Instance Concept Definition Negative Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1990

Authors and Affiliations

  • Haym Hirsh
    • 1
  1. 1.Rutgers UniversityUSA

Personalised recommendations