runs Joel Ratsaby Ben Gurion University of the Negev P.O.B. 653, Be'er Sheva...  Home/Search
Context
Related
| bgu.ac.il/~ratsaby/P...RATSABYBFCA.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: bgu.ac.il/~ratsaby...Publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The Vapnik-Chervonenkis (VC) dimension (also known as the trace number) and the Sauer-Shelah lemma have found applications in numerous areas including set theory, combinatorial geometry, graph theory and statistical learning theory. Estimation of the complexity of discrete structures associated with the search space of algorithms often amounts to estimating the cardinality of a simpler class which is e#ectively induced by some restrictive property of the search. In this paper we study the... (Update)
Active bibliography (related documents): More All
0.5: Discrete Mathematics and Theoretical Computer Science DMTCS.. - Bernard Ycart And (Correct)
0.5: On the Complexity of Good Samples for Learning - Joel Ratsaby Department (Correct)
0.5: Journal of Machine Learning Research 7 (2006) 665--704.. - Clayton Scott Cscott (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ ratsaby-complexity,
author = "Runs Joel Ratsaby",
title = "Complexity of VC-classes of sequences with long repetitive",
url = "citeseer.ist.psu.edu/745861.html" }
Citations (may not include all citations):947 Statistical Learning Theory (context) - Vapnik - 1998
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Ya et al. - 1971
318 Convergence of Stochastic Processes (context) - Pollard - 1984
115 the density of families of sets (context) - Sauer - 1972
91 Epsilon-nets and simplex range queries (context) - Haussler, Welzl - 1987
88 Neural Network LearningTheoretical Foundation (context) - Bartlett, Learning et al. - 1999
71 Scale-sensitive dimensions (context) - Alon, Ben-David et al. - 1997
34 ciency for tests of a hypothesis based on the sum of observa.. (context) - Cherno, of - 1952
31 Sphere packing numbers for subsets of the boolean n-cube wit.. - Haussler - 1995
21 A generalization of Sauer's lemma (context) - Haussler, Long - 1995
19 The shifting technique in extremal set theory (context) - Frankl - 1987
18 Poisson approximation and the chen-stein method (context) - Arratia, Goldstein et al. - 1990
15 the trace of finite sets (context) - Frankl - 1983
12 stability and order for models and theories in infinitary la.. (context) - Shelah, problem - 1972
9 and combinatorial probability (context) - Bollobas, Set et al. - 1986
8 the density of sets of vectors (context) - Alon - 1983
6 The Vapnik-Chervonenkis dimension of a random graph - Anthony, Brightwell et al. - 1995
3 Wiley-Interscience Series (context) - Pach, Agarwal - 1995
2 Introduction to Statistical Learning Theory (context) - Boucheron, Bousquet et al. - 2004
2 A constrained version of Sauer's lemma - Ratsaby - 2004
1 Compound poisson approximation: A user's guide (context) - Barbour, Chryssaphinou - 2001
Documents on the same site (http://www.bgu.ac.il/~ratsaby/Publications.htm): More
Complexity of Hyperconcepts Joel Ratsaby - Ben Gurion University (2005) (Correct)
Discrete Mathematics and Theoretical Computer Science DMTCS.. - Bernard Ycart And (Correct)
On the Complexity of Constrained VC-Classes Joel Ratsaby - Ben Gurion University (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC