Encyclopedia of Machine Learning

2010 Edition
| Editors: Claude Sammut, Geoffrey I. Webb

Candidate-Elimination Algorithm

Reference work entry
DOI: https://doi.org/10.1007/978-0-387-30164-8_91

Mitchell’s, (1982, 1997) candidate-elimination algorithm performs a bidirectional search in the  hypothesis space. It maintains a set, S, of most specific hypotheses that are consistent with the training data and a set, G, of most general hypotheses consistent with the training data. These two sets form two boundaries on the version space. See  Learning as Search.

Recommended Reading

  1. Mitchell, T. M. (1982). Generalization as search. Artificial Intelligence, 18(2), 203–226.MathSciNetGoogle Scholar
  2. Mitchell, T. M. (1997). Machine learning. New York: McGraw-Hill.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011