scientific article

zbMath1222.68239MaRDI QIDQ3174151

Dima Kuzmin, Manfred K. Warmuth

Publication date: 12 October 2011

Full work available at URL: http://www.jmlr.org/papers/v8/kuzmin07a.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

VC dimensionmaximum classescompression schemesone-inclusion graph

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (17)

Unlabeled sample compression schemes and corner peelings for ample and maximum classes ⋮ Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property ⋮ On partial cubes, well-graded families and their duals with some applications in graphs ⋮ Compression schemes for concept classes induced by three types of discrete undirected graphical models ⋮ Teaching and Compressing for Low VC-Dimension ⋮ Sign rank versus Vapnik-Chervonenkis dimension ⋮ Learning the set covering machine by bound minimization and margin-sparsity trade-off ⋮ Some new maximum VC classes ⋮ Algebraic methods proving Sauer's bound for teaching complexity ⋮ Unnamed Item ⋮ Order compression schemes ⋮ Bounding Embeddings of VC Classes into Maximum Classes ⋮ Shifting: one-inclusion mistake bounds and sample compression ⋮ Shattering-extremal set systems from Sperner families ⋮ On density of subgraphs of halved cubes ⋮ Labeled Compression Schemes for Extremal Classes ⋮ On Version Space Compression

This page was built for publication: