View Single Post
  #2  
Old 04-08-2013, 01:43 PM
yaser's Avatar
yaser yaser is offline
Caltech
 
Join Date: Aug 2009
Location: Pasadena, California, USA
Posts: 1,477
Default Re: Proof of Growth Function when Points are not binary

Quote:
Originally Posted by udaykamath View Post
I understand the step by step process in bounding the growth function B(N,k) in terms of recursion using x1,x2...xN data points using structural arrangements. I however started thinking, in a numerical data where x1,x2...xN is real numbers we cannot use this alpha + 2* Beta trick and use the polynomial bound by combination? What is the bounds when data is not binary ? Is it still Polynomial in N, and how?
You are correct. For non-binary functions, the argument is more elaborate. This is addressed in Vapnik's book "Statistical Learning Theory" in much detail, and also appears in other books and papers.
__________________
Where everyone thinks alike, no one thinks very much
Reply With Quote