Login / Signup
On the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes.
Jürgen Forster
Hans Ulrich Simon
Published in:
Theor. Comput. Sci. (2006)
Keyphrases
</>
half spaces
concept classes
learning theory
concept class
vc dimension
upper bound
decision lists
pac learning
efficient learning
learning models
sample complexity
data sets
special case
target concept
vapnik chervonenkis dimension
uniform distribution
euclidean space
learning algorithm