Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
From MaRDI portal
Publication:1338464
DOI10.1007/BF02574389zbMath0813.52013OpenAlexW1967689501WikidataQ54309388 ScholiaQ54309388MaRDI QIDQ1338464
Publication date: 1 December 1994
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131339
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Unlabeled sample compression schemes and corner peelings for ample and maximum classes, Ample Completions of Oriented Matroids and Complexes of Uniform Oriented Matroids, When Can Splits be Drawn in the Plane?, Purity and Separation for Oriented Matroids, Ham-sandwich cuts for abstract order types, Sign rank versus Vapnik-Chervonenkis dimension, Some new maximum VC classes, A counterexample to Las Vergnas' strong map conjecture on realizable oriented matroids, Transit sets of two-point crossover, Unnamed Item, Shifting: one-inclusion mistake bounds and sample compression, Labeled Compression Schemes for Extremal Classes, Two-dimensional partial cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Oriented matroids with few mutations
- Results on learnability and the Vapnik-Chervonenkis dimension
- Teilungen der Ebenen durch Geraden oder topologische Geraden
- Probability inequalities for empirical processes and a law of the iterated logarithm
- Some limit theorems for empirical processes (with discussion)
- \(\epsilon\)-nets and simplex range queries
- Donsker classes of sets
- An axiomatic of non-Radon partitions of oriented matroids
- On the combinatorial classification of nondegenerate configurations in the plane
- Proof of Grünbaum's conjecture on the stretchability of certain arrangements of pseudolines
- Lopsided sets and orthant-intersection by convex sets
- Three points do not determine a (pseudo-) plane
- Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
- Almost tight bounds for \(\epsilon\)-nets
- Oriented matroids
- Existence of submatrices with all possible columns
- Orientability of matroids
- Central limit theorems for empirical measures
- Discrepancy and approximations for bounded VC-dimension
- Bounding the vertex cover number of a hypergraph
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- A characterization of oriented matroids in terms of topes
- Quasi-optimal range searching in spaces of finite VC-dimension
- Density and dimension
- Axioms for maximal vectors of an oriented matroid: A combinatorial characterization of the regions determined by an arrangement of pseudohyperplanes
- A combinatorial problem; stability and order for models and theories in infinitary languages
- Distance-preserving subgraphs of hypercubes
- On the density of families of sets
- Learnability and the Vapnik-Chervonenkis dimension
- Capacity and Error Estimates for Boolean Classifiers with Limited Complexity
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Convergence of stochastic processes
