2 citations · 3 across the 6 of their papers we have counts for
6 papers
Binary strings of finite VC dimension
Hunter R Johnson
Any binary string can be associated with a unary predicate on . In this paper we investigate subsets named by a predicate such that the relation has fi…
Some new maximum VC classes
Hunter Johnson
Set systems of finite VC dimension are frequently used in applications relating to machine learning theory and statistics. Two simple types of VC classes which have been widely stu…
Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property
Hunter R. Johnson
This paper presents some finite combinatorics of set systems with applications to model theory, particularly the study of dependent theories. There are two main results. First, we…
VC density and dp rank
Hunter Johnson
We derive that dpR(n) \leq dens(n) \leq dpR(n)+1, where dens(n) is the supremum of the VC density of all formulas in n parameters, and dpR(n) is the maximum depth of an ICT pattern…
Dp-rank and forbidden configurations
Hunter Johnson
A theory is shown to have an ICT pattern of depth in variables $\xbar$ iff it interprets some -maximum VC class in $|\xbar|$ parameters.
Maximum VC families
Hunter Johnson
Maximum VC classes which are stable in the sense of model theory are characterized.