LFD Book Forum  

Go Back   LFD Book Forum > Book Feedback - Learning From Data > Chapter 2 - Training versus Testing
Reload this Page Exercise 2.13
FAQ Calendar Mark Forums Read

 
 
Thread Tools Display Modes
Prev Previous Post   Next Post Next
  #1  
Old 10-23-2014, 08:43 PM
mahaitao mahaitao is offline
Junior Member
  
Join Date: Oct 2014
Posts: 6
Default 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?
Reply With Quote
 

« Previous Thread | Next Thread »
Thread Tools
Display Modes
Threaded Mode Threaded Mode

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts
BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump


All times are GMT -7. The time now is 01:15 PM.

Contact Us - LFD Book - Top

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. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.