Complexity of Computing Vapnik-Chervonenkis Dimension.
ALT, , pp.279-287 (1993), [peer-reviewed]
- ALT
Abstract / 概要
The Vapnik-Chervonenkis (VC) dimension is known to be the crucial measure of the polynomial-sample learnability in the PAC-learning model. This paper investigates the complexity of computing VC-dimension of a concept class over a finite learning domain. We consider a…