Question 9
I'm having trouble understanding the problem. Picking an arbitrary triangle and N points, it seems simple to pick N points such that every point can be moved inside and outside the triangle effectively making h(x) equal to 1 or 1 at will. This obviously doesn't seem to be the correct line of thinking or else I would think the answer is just 2^N because all dichotomies are realized.
Do the chosen points within N need to consist of the three endpoints of the triangle? If that's the case, how does choice 'a' where N = 1 make up a triangle since it's only a singular point? Any clarity is appreciated :) 
Re: Question 9
Quote:

Re: Question 9
Quote:
This puts a strong constraint on the way that the points are divided up by such a triangle hypothesis, if you think of the points as being connected to the ones to the left and the right in the polygon. This is enough to get the exact value of the minimum break point. I have to admit it took me quite a while to tie this argument together. 
Re: Question 9
Is the answer in the Solution key for Question 9, Homework 3 correct?

Re: Question 9
Quote:

Re: Question 9
thanks for this question
القسط الهندي 
All times are GMT 7. The time now is 05:17 AM. 
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.