Prerequisite: Concept and Concept Learning

The step-wise working of the find-S algorithm is given as -

  1. The process starts with initializing ‘h’ with the most specific hypothesis, generally, it is the first example in the dataset.
  2. We check for each positive example. If the example is negative, we will move on to the next example but if it a positive example we will consider it for the next step.
  3. We will check if each attribute in the example is equal to the hypothesis value.
  4. If the value matches, then no changes are made.
  5. If the value does not match, the value is changed to “?”.
  6. We do this until we reach the last positive example in the dataset.