On the complexity of constrained VC-classes |
| |
Authors: | Joel Ratsaby |
| |
Affiliation: | Department of Computer Science, University College London, Gower Street, London WC1E 6BT, UK |
| |
Abstract: | Sauer's lemma is extended to classes HN of binary-valued functions h on [n]={1,…,n} which have a margin less than or equal to N on all x∈[n] with h(x)=1, where the margin μh(x) of h at x∈[n] is defined as the largest non-negative integer a such that h is constant on the interval Ia(x)=[x-a,x+a]⊆[n]. Estimates are obtained for the cardinality of classes of binary-valued functions with a margin of at least N on a positive sample S⊆[n]. |
| |
Keywords: | Sauer's lemma VC-dimension Boolean functions Integer partitions |
本文献已被 ScienceDirect 等数据库收录! |
|