๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


The VC-Dimension of Sperner Systems
โœ G. Greco ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 119 KB

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

Sperner families of bounded VC-dimension
โœ R.P. Anstee; A. Sali ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 344 KB

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

The VC dimension of k-fold union
โœ David Eisenstat; Dana Angluin ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 114 KB