k-Fold unions of low-dimensional concept classes

Information Processing Letters

Volumn 109, Issue 23-24, 2009, Pages 1232-1234

  Eisenstat, David ^a  

^a NONE   (United States)

Author keywords

Combinatorial problems; Concept class; Intersection of concepts; Union of concepts; VC dimension

Indexed keywords

COMBINATORIAL PROBLEMS; CONCEPT CLASS; UNION OF CONCEPTS; VC DIMENSION;

EID: 70350028703     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2009.09.005     Document Type: Article

References (7)

1. Blumer A., Ehrenfeucht A., Haussler D., and Warmuth M.K. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM 36 4 (1989) 929-965
2. Dobkin D.P., and Gunopulos D. Concept learning with geometric hypotheses. COLT '95: Proceedings of the Eighth Annual Conference on Computational Learning Theory (1995), ACM, New York, NY, USA 329-336
3. Eisenstat D., and Angluin D. The VC dimension of k-fold union. Information Processing Letters 101 5 (2007) 181-184
4. Haussler D., and Welzl E. Epsilon-nets and simplex range queries. Discrete & Computational Geometry 2 (1987) 127-151
5. Johnson H.R. Definable families of finite Vapnik Chervonenkis dimension. PhD thesis, University of Maryland (2008). http://hdl.handle.net/1903/8174
6. Vapnik V., and Chervonenkis A.Ya. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications 16 2 (1971) 264-280
7. Wenocur R.S., and Dudley R.M. Some special Vapnik-Chervonenkis classes. Discrete Mathematics 33 3 (1981) 313-318