top of page
Search

Candidate Elimination Algorithm

  • Writer: DR.GEEK
    DR.GEEK
  • Jun 14, 2020
  • 1 min read

(18th-June-2020)


• The candidate elimination algorithm incrementally builds the version space given a hypothesis space H and a set E of examples. The examples are added one by one; each example possibly shrinks the version space by removing the hypotheses that are inconsistent with the example. The candidate elimination algorithm does this by updating the general and specific boundary for each new example. This is described in Figure 7.1.4.


 
 
 

Comments


© 2023 by Walkaway. Proudly created with Wix.com

  • Facebook Black Round
  • Twitter Black Round
bottom of page