哈工大深圳机器学习08ML试题答案.docVIP

1 Give the definitions or your comprehensions of the following terms.(12’) 1.1 The inductive learning hypothesis P17 1.2 Overfitting P49 1.4 Consistent learner P148 2 Give brief answers to the following questions.(15’) 2.2 If the size of a version space is , In general what is the smallest number of queries may be required by a concept learner using optimal query strategy to perfectly learn the target concept? P27 2.3 In genaral, decision trees represent a disjunction of conjunctions of constrains on the attribute values of instanse,then what expression does the following decision tree corresponds to ? 3 Give the explaination to inductive bias, and list inductive bias of CANDIDATE-ELIMINATION algorithm, decision tree learning(ID3), BACKPROPAGATION algorithm.(10’) How to solve overfitting in decision tree and neural network?(10’) Solution: Decision tree: 及早停止树增长(stop growing earlier) 后修剪法(post-pruning) Neural Network 权值衰减(weight decay) 验证数据集(validation set) 5 Prove that the LMS weight update rule performs a gradient descent to minimize the squared error. In particular, define the squared error E as in the text. Now calculate the derivative of E with respect to the weight , assuming that is a linear function as defined in the text. Gradient descent is achieved by updating each weight in proportion to . Therefore, you must show that the LMS training rule alters weights in this proportion for each training example it encounters. ( ) (8’) Solution： As Vtrain(b)((Successor(b)) we can get E= = As mentioned in LMS: We can get Therefore, gradient descent is achievement by updating each weight in proportion to ; LMS rules alters weights in this proportion for each training example it encounters. 6 True or false: if decision tree D2 is an elaboration of tree D1, then D1 is more-general-than D2. Assume D1 and D2 are decision trees representing arbitrary boolean funcions, and that D2 is an elaboration of D1 if ID3 could extend D1 to D2. If tru