The VC dimension of k-fold union

Information Processing Letters

Volumn 101, Issue 5, 2007, Pages 181-184

  Eisenstat, David ^a   Angluin, Dana ^b  

^a PRINCETON UNIVERSITY   (United States)

^b YALE UNIVERSITY   (United States)

Author keywords

Combinatorial problems; Concept classes; Intersections of concepts; Unions of concepts; VC dimension

Indexed keywords

ASYMPTOTIC STABILITY; PROBLEM SOLVING;

COMBINATORIAL PROBLEMS; CONCEPT CLASSES; INTERSECTIONS OF CONCEPTS; UNIONS OF CONCEPTS; VC DIMENSION;

COMPUTATIONAL GEOMETRY;

EID: 33846069101     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.10.004     Document Type: Article

References (3)

1. Blumer A., Ehrenfeucht A., Haussler D., and Warmuth M.K. Learnability and the Vapnik-Chervonenkis dimension. J. ACM 36 4 (1989) 929-965
2. L. Reyzin, Lower bounds on the VC dimension of unions of concept classes, Technical Report 1349, Yale University Department of Computer Science, April 2006
3. Vapnik V.N., and Chervonenkis A.Y. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16 2 (1971) 264-280