Shifting: One-inclusion mistake bounds and sample compression
- 1 January 2009
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (1) , 37-59
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The one-inclusion graph algorithm is near-optimal for the prediction model of learningIEEE Transactions on Information Theory, 2001
- Combinatorial variability of vapnik-chervonenkis classes with applications to sample compression schemesDiscrete Applied Mathematics, 1998
- Sample compression, learnability, and the Vapnik-Chervonenkis dimensionMachine Learning, 1995
- Sphere packing numbers for subsets of the Boolean n-cube with bounded Vapnik-Chervonenkis dimensionJournal of Combinatorial Theory, Series A, 1995
- Characterizations of Learnability for Classes of {0, ..., n)-Valued FunctionsJournal of Computer and System Sciences, 1995
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Embeddings in hypercubesMathematical and Computer Modelling, 1988
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- Isometric embedding of a graph in a Boolean cubeCybernetics and Systems Analysis, 1965
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935