Identifying codes in hereditary classes of graphs and VC-dimension.
Nicolas BousquetAurélie LagoutteZhentao LiAline ParreauStéphan ThomasséPublished in: CoRR (2014)
Keyphrases
- vc dimension
- pac learnability
- vapnik chervonenkis
- upper bound
- concept classes
- sample complexity
- sample size
- vapnik chervonenkis dimension
- function classes
- covering numbers
- inductive inference
- statistical learning theory
- lower bound
- efficiently learnable
- worst case
- generalization bounds
- concept class
- learning theory
- euclidean space
- theoretical analysis
- data compression
- uniform convergence
- learning algorithm
- data sets
- small number
- knn
- machine learning