title: Candidate Elimination Algorithm
body: <p>Consider the following training data sets.. </p>
  
  <pre><code>+-------+-------+----------+-------------+
  | Size  | Color | Shape    | Class/Label |
  +=======+=======+==========+=============+
  | big   | red   | circle   | No          |
  | small | red   | triangle | No          |
  | small | red   | circle   | Yes         |
  | big   | blue  | circle   | No          |
  | small | blue  | circle   | Yes         |
  +-------+-------+----------+-------------+
  </code></pre>
  
  <p>I would like to understand how the algorithm proceeds when it starts with a negative example and when two negative examples come together.</p>
  
  <p>This is not an assignment question by the way.</p>
  
  <p>Examples with other data sets are also welcome! This is to understand the negative part of the algorithm.</p>