Bài tập lý thuyết 2.3

[Cang Do]

Consider again the EnjoySport learning task and the hypothesis space H described in Section 

2.2. Let us define a new hypothesis space H' that consists of all pairwise disjunctions of the 

hypotheses in H. For example, a typical hypothesis in H' is 

(?, Cold, High, ?, ?, ?) v (Sunny, ?, High, ?, ?, Same) 

Trace the CANDIDATE-ELIMINATATION algorithm for the hypothesis space 

H' given the sequence of training examples from Table 2.1 (i.e., show the sequence of S and G 

boundary sets.)