Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Kluwer Academic Publishers
About this chapter
Cite this chapter
Hirsh, H. (1990). The Candidate-Elimination Algorithm: Emulation and Extensions. In: Incremental Version-Space Merging: A General Framework for Concept Learning. The Kluwer International Series in Engineering and Computer Science, vol 104. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1557-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1557-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8834-3
Online ISBN: 978-1-4613-1557-5
eBook Packages: Springer Book Archive