哈工大深圳机器学习复习2——丁宇新MachineLearning.docVIP

In the EnjoySport learning task, every example day is represented by 6 attributes. Given that attributes Sky has three possible values, and that AirTemp、Humidity、Wind、Wind、Water and Forecast each have two possible values. Explain why the size of the hypothesis space is 973. How would the number of possible instances and possible hypotheses increase with the addition of one attribute A that takes on on K possible values? Write the algorithm of Candidate_Elimination using version space. Assume G is the set of maximally general hopytheses in hypothesis space H, and S is the set of maximally specific hopytheses. Consider the following set of training examples for EnjoySport: Example Sky AirTemp Humidity Wind Water Forcast EnjoySport 1 sunny warm normal strong warm same Yes 2 sunny warm high strong warm same yes 3 rainy cold high strong warm chagge no 4 sunny warm high strong cool change yes 5 sunny warm normal weak warm same no What is the Entropy of the collection training examples with respect to the target function classification? According to the 5 traning examples, compute the decision tree that be learned by ID3, and show the decision tree. (log23=1.585, log25=2.322) Give several approaches to avoid overfitting in decision tree learning. How to determin the correct final tree size? Write the BackPropagation algorithm for feedforward network containing two layers of sigmoid units. Explain the Maximum a posteriori(MAP) hypothesis. Using Naive Byes Classifier to classify the new instance: Outlook=sunny,Temperature=cool,Humidity=high,Wind=strong Our task is to predict the target value (yes or no) of the target concept PlayTennis for this new instance. The table blow provides a set of 14 training examples of the target concept. Day Outlook Temperature Humidity Wind PlayTennis D1 D2 D3 D4 D5 D6 D7 D8 D9 D10 D11 D12 D13 D14 Sunny Sunny Overcast Rain Rain Rain Overcast Sunny Sunny Rain Sunny Overcast Overcast Rain Hot Hot Hot Mild Cool Cool Cool Mild Cool Mild Mil