Some new maximum VC classes

DOI10.1016/j.ipl.2014.01.006zbMath1284.68604arXiv1309.2626OpenAlexW2059728575MaRDI QIDQ2446573

Hunter Johnson

Publication date: 17 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.2626

zbMATH Keywords

VC dimensioncombinatorial problemscomputational geometry

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Unlabeled sample compression schemes and corner peelings for ample and maximum classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some special Vapnik-Chervonenkis classes
• Balls in \(\mathbb{R}^k\) do not cut all subsets of \(k+2\) points
• Combinatorial variability of Vapnik-Chervonenkis classes with applications to sample compression schemes
• Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
• Geometric measure theory.
• dp-rank and forbidden configurations
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Shattering All Sets of ‘k’ Points in “General Position” Requires (k — 1)/2 Parameters
• Uniform Central Limit Theorems
• On Vapnik‐Chervonenkis density over indiscernible sequences
• A Geometric Approach to Sample Compression
• Measure Theory and Probability Theory
• Enumeration of Seven-Argument Threshold Functions
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities

This page was built for publication: Some new maximum VC classes