Login / Signup
A Comparison of Complexity Selection Approaches for Polynomials Based on: Vapnik-Chervonenkis Dimension, Rademacher Complexity and Covering Numbers.
Przemyslaw Klesk
Published in:
ICAISC (2) (2012)
Keyphrases
</>
vapnik chervonenkis dimension
vc dimension
covering numbers
sample complexity
concept classes
learning machines
worst case
upper bound
uniform convergence
concept class
theoretical analysis
sample size
statistical learning theory