Unlabeled compression schemes for maximum classes
From MaRDI portal
Publication:3174151
zbMATH Open1222.68239MaRDI QIDQ3174151FDOQ3174151
Dima Kuzmin, Manfred K. Warmuth
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v8/kuzmin07a.html
Recommendations
Cited In (19)
- Labeled sample compression schemes for complexes of oriented matroids
- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property
- Teaching and Compressing for Low VC-Dimension
- Learning Theory
- Bounding Embeddings of VC Classes into Maximum Classes
- Labeled Compression Schemes for Extremal Classes
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- Some new maximum VC classes
- Compression schemes for concept classes induced by three types of discrete undirected graphical models
- Sign rank versus Vapnik-Chervonenkis dimension
- Algebraic methods proving Sauer's bound for teaching complexity
- On Version Space Compression
- Order compression schemes
- Learning the set covering machine by bound minimization and margin-sparsity trade-off
- Title not available (Why is that?)
- On density of subgraphs of halved cubes
- Shifting: one-inclusion mistake bounds and sample compression
- Shattering-extremal set systems from Sperner families
- On partial cubes, well-graded families and their duals with some applications in graphs
This page was built for publication: Unlabeled compression schemes for maximum classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174151)