-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAlgorithm
More file actions
23 lines (18 loc) · 989 Bytes
/
Algorithm
File metadata and controls
23 lines (18 loc) · 989 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
### Candidate Elimination Algorithm
G :maximally general hypotheses in H
S :maximally specific hypotheses in H
For each training example d=<x,c(x)>
Case 1 : If d is a positive example
Remove from G any hypothesis that is inconsistent with d
For each hypothesis s in S that is not consistent with d
Remove s from S.
Add to S all minimal generalizations h of s such that h consistent with d
Some member of G is more general than h
Remove from S any hypothesis that is more general than another hypothesis in S
Case 2: If d is a negative example
Remove from S any hypothesis that is inconsistent with d
For each hypothesis g in G that is not consistent with d
Remove g from G.
Add to G all minimal specializations h of g such that h consistent with d
Some member of S is more specific than h
Remove from G any hypothesis that is less general than another hypothesis in G