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

[Cang Do]

 Consider the instance space consisting of integer points in the x, y plane and the set of 

hypotheses H consisting of rectangles. More precisely, hypotheses are of the form a ≤x ≤b, c ≤y≤

d, where a, b, c, and d can be any integers. 

(a) Consider the version space with respect to the set of positive (+) and negative (-) training 

examples shown below. What is the S boundary of the version space in this case? Write out the 

hypotheses and draw them in on the diagram. 

(b) What is the G boundary of this version space? Write out the hypotheses and draw them in. 

(c) Suppose the learner may now suggest a new x, y instance and ask the trainer for its 

classification. Suggest a query guaranteed to reduce the size of the version space, regardless of 

how the trainer classifies it. Suggest one that will not. 

(d) Now assume you are a teacher, attempting to teach a particular target concept (e.g., 3 ≤x ≤5, 

2 ≤y ≤9). What is the smallest number of training examples you can provide so that the 

CANDIDATE-ELIMINATION algorithm will perfectly learn the target concept? 

[Nguyễn Đăng Thái Bình (URANUS IT JSC)]

Slide doc tuong doi de hieu. Share cho ACE

 

Best Regards,

NDTBinh

[Cang Do]

Thanks. cai nay hom bua Giam Doc co gui roi.

Bí kiếp võ công càng nhiều thì xảy ra 2 hướng:

1/ Anh nào có tư chất võ học thì có thể luyện thành công và tổng hợp ra môn võ mới ( rất hiếm)

2/ Anh nào bình thường thì tẩu hỏa nhập ma ( đa phần chúng ta)

Haha

--
You received this message because you are subscribed to the Google Groups "Forum thảo luận cho lớp cao học khóa 5" group.
To post to this group, send email to ch...@googlegroups.com.
To unsubscribe from this group, send email to chk5+uns...@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/chk5?hl=en.