Summary

• Concept learning can be seen as search.
• General-to-Specific partial ordering of hypotheses can be used to organize search
• Find-S and Candidate-Elimination algorithms
• Inductive learning algorithms are able to classify unseen examples only because of their implicit inductive bias for selecting one consistent hypothesis over another.
• An unbiased learner cannot make inductive leaps to classify unseen examples.