Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes

Discrete Applied Mathematics

Volumn 86, Issue 1, 1998, Pages 3-25

  Ben David, Shai ^a   Litman, Ami ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010575050     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00000-6     Document Type: Article

References (16)

1. N. Alon, P. Frankl, V. Rodel, Geometrical relation of set systems and probabilistic communication complexity, Proc. Symp. on the Theory of Computing, 1985, pp. 277-280.
2. S. Ben-David, N. Bshouty, E. Kushilevitz, A composition theorem for learning algorithms with applications to geometric concept classes, ECCC Technical Report TR96-059 (1996), and Proc. 29th annual ACM symp. on theory of computing, (STOC'97), pp. 324-333.
3. S. Ben-David, N. Bshouty, E. Kushilevitz, A composition theorem for learning algorithms with applications to geometric concept classes, ECCC Technical Report TR96-059 (1996), and Proc. 29th annual ACM symp. on theory of computing, (STOC'97), pp. 324-333.
4. S. Ben-David, N. Eiron, H.U. Simon, On the embeddability of finite VC classes in classes of halfspaces, Technion CS department manuscript, 1997.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36(4), (1989) 929-965.
6. C.C. Chang, H.J. Keisler, Model Theory, North-Holland, Amsterdam, 1990.
7. R.M. Dudley, A Course on Empirical Precesses, Lecture Notes in Mahematics, vol. 1997, Springer, New York, 1984.
8. S. Floyd, On space bounded learning and the Vapnik-Chervonenkis dimension, Ph.D. thesis, International Computer Science Institute, Technical Report, TR-89-061.
9. S. Floyd, M. Warmuth, Sample compression, learnability, and the Vapnik-Chervonenkis dimension, Mach. Learning, 21, (1995) 1-36.
10. P.W. Goldberg, M. Jerrum, Bounding the Vapnik-Chervonenkis dimension of concept classes parametrized by real numbers, Mach. Learning, 18 (1995) 131-148.
11. [101 M.C. Laskowski, Vapnik-Cervonenkis classes of definable sets, J. London Math. Soc. 45(2), (1992) 377-384.
12. N. Littlestone, Mistake bounds and logarithmic linear-threshold learning algorithms, Ph.D. thesis, U.C. Santa Cruz, March 1989.
13. N. Littlestone, M. Warmuth, Relating data compression and learnability, Unpublished manuscript, (1986).
14. B.K. Natarajan, On learning sets and function, Mach. Learning 4 (1989) 67-97.
15. L. Pitt, M. Warmuth, Prediction preserving reducibility, J. Comput. System Sci. 41 (1990) 430-467.
16. N. Sauer, On the density of families of sets, J. Combin. Theory. Ser. A 13 (1972) 145-147.