Exercise 2.13
In Exercise 2.13 (a), Prove dvc(H)<=log_2M. How to think this problem? M is the number of hypotheses, what is the relationship between dvc and M?
(b) What does dvc(\cap H_k) and \cap H_k the intersection of hypotheses mean? How can we intersect hypotheses? 
Re: Exercise 2.13
For (a), maybe it is worth thinking about the dichotomies that can be generated by hypotheses?
For (b), the intersection and union of hypothesis "sets" are simply "set" intersection and union. http://en.wikipedia.org/wiki/Union_%28set_theory%29 Hope this helps. 
Re: Exercise 2.13
Professor Lin,
I think that I did not represent my question clear. In perceptron example, we have only one H that is a set of infinite lines in the plane. My question is if we consider that H is a union of some subsets, what are they? They are subsets of these infinite lines? How to distinguish them? And how about intersection of these subsets? 
Re: Exercise 2.13
I got it. Thanks for your patience, professor Lin.

All times are GMT 7. The time now is 05:32 PM. 
Powered by vBulletin® Version 3.8.3
Copyright ©2000  2019, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. AbuMostafa, Malik MagdonIsmail, and HsuanTien Lin, and participants in the Learning From Data MOOC by Yaser S. AbuMostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.