机器学习第三章答案.pdfVIP

3.1 Give decision trees to represent the following boolean functions: (a) A ∧¬B (b) A ∨ [B ∧ C] (c) A XOR B (d) [A∧ B] ∨ [C ∧ D] Ans. (a) A ∧¬B (b) A ∨ [B ∧ C] (c) A XOR B (d) [A∧ B] ∨ [C ∧ D] 3.2 Consider the following set of training examples: (a) What is the entropy of this collection of training examples with respect to the target function classification? (b) What is the information gain of a2 relative to these training examples? Ans. (a) Entropy = 1 (b) Gain(a2) = 1-4/6*1-2/6*1 = 0 3.4. ID3 searches for just one consistent hypothesis, whereas the CANDIDATE-ELIMINATION algorithm finds all consistent hypotheses. Consider the correspondence between these two learning algorithms. (a) Show the decision tree that would be learned by ID3 assuming it is given the four training examples for the Enjoy Sport? target concept shown in Table 2.1 of Chapter 2. (b) What is the relationship between the learned decision tree and the version space (shown in Figure 2.3 of Chapter 2) that is learned from these same examples? Is the learned tree equivalent to one of the members of the version space? (c) Add the following training example, and compute the new decision tree. This time, show the value of the information gain for each candidate attribute at each step in growing the tree. Sky Air-Temp Humidity Wind Water Forecast Enjoy-Sport? Sunny Warm Normal Weak Warm Same No Ans. (a) Decision tree: (b) Version space contains all hypotheses consistent with the training examples, whereas, the learned decision tree is one of the hypotheses (i.e., the first acceptable hypothesis with respect to the inductive bias) consistent with the training examples. Also, decision tree has a richer expression than hypothesis of version space which contains only conjunction forms of attribute constraints. If the target function is not contained in the hypothesis space (it may happen as {∧} is not a minimum complete basis), the version space will be empty. In this ex