Unlabeled compression schemes for maximum classes
From MaRDI portal
Publication:3174151
Recommendations
Cited in
(24)- Shattering-extremal set systems from Sperner families
- On partial cubes, well-graded families and their duals with some applications in graphs
- Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property
- Labeled sample compression schemes for complexes of oriented matroids
- Teaching and Compressing for Low VC-Dimension
- Learning Theory
- Generalizing labeled and unlabeled sample compression to multi-label concept classes
- Unlabeled sample compression schemes and corner peelings for ample and maximum classes
- On version space compression
- Unlabeled compression schemes exceeding the VC-dimension
- 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
- Order compression schemes
- Order compression schemes
- Learning the set covering machine by bound minimization and margin-sparsity trade-off
- A geometric approach to sample compression
- scientific article; zbMATH DE number 7561527 (Why is no real title available?)
- On density of subgraphs of halved cubes
- Unlabeled sample compression schemes for oriented matroids
- Shifting: one-inclusion mistake bounds and sample compression
- Bounding embeddings of VC classes into maximum classes
- Labeled compression schemes for extremal classes
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)
