Linear algebraic proofs of VC-dimension based inequalities

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1208, Issue , 1997, Pages 238-250

  Gurvits, Leonid ^a,b  

^a NEC LABORATORIES AMERICA   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR ALGEBRA;

CARDINALITIES; CONNECTED SUBGRAPHS; CONSTANT FUNCTIONS; LINEAR-ALGEBRAIC; MAXIMUM CLASS; SAMPLE COMPRESSION; VC DIMENSION;

COMPUTATION THEORY;

EID: 84949230472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62685-9_20     Document Type: Conference Paper

References (7)

1. [BF92] L.Babai and P.Frankl. Linear algebra methods in combinatorics with applications to geometry and computer science. (Preliminary Version 2), 1992, Dept, of Computer Science, The University of Chicago.
2. [FrWi8l] P.Frankl and R.M.Wilson. Intersection theorems with geometric consequences. Combinatorica 1(1981), 357-368.
3. [FW95] S.Floyd and M.Warmuth. Sample compression, learnability, and the Vapnik-Chervonenkis dimension, Machine Learning 1-36, 1995.
4. [We] E. Welzl.(1987). Complete range spaces.Unpublished notes.
5. [HL] D.Haussler and Phil Long.(1991) A generalization of Sauer's lemma, UCSC-CRL-90-15.
6. [GJ93] P.Goldberg and M.Jerrum (1993). Bounding the Vapnik-Chervonenkis dimension of concepts classes parameterized by real numbers. In proc. 6th Annual ACM Conference on Computational Learning Theory.
7. [Sa72] N.Sauer (1972). On the density of families of sets. J.Comb. Theory, Series A 13(1972), 145-147.