Anthony, M. and Shawe-Taylor, J.
A Result of Vapnik with Applications
Discrete Applied Mathematics, 47, (3), .
Full text not available from this repository.
A new proof of a result due to Vapnik is given. Its implications for the theory of PAC learnability are discussed, with particular reference to the learnability of functions taking values in a countable set. An application to the theory of artificial neural networks is then given.
Actions (login required)