Measuring the VC-Dimension of a Learning Machine
โ Scribed by Vapnik, Vladimir; Levin, Esther; Cun, Yann Le
- Book ID
- 111676026
- Publisher
- MIT Press
- Year
- 1994
- Tongue
- English
- Weight
- 909 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0899-7667
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A family F of subsets of a finite set X shatters a set D X, if the intersections of the members of F with D coincide with the power set of D. The maximum size of a set shattered by F is the VC-dimension (or density) of the system. P. Frankl (1983, J. Combin. Theory Ser. A 34, 41 45) investigates the
We explore a problem of Frankl (1989). A family ~ of subsets of {1, 2, ..., m} is said to have trace Kk if there is a subset SC\_{1,2 ..... m} with IS] = k so that {FNSIF C .~} yields all 2 k possible subsets. Frankl (1989) conjectured that a family ~ which is an antichain (in poser given by C\_ ord