A Result of Vapnik with Applications

Anthony, M. and Shawe-Taylor, J. (1993) A Result of Vapnik with Applications Discrete Applied Mathematics, 47, (3), pp. 207-217.


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.

Item Type: Article
ISSNs: 0166-218X (print)
Organisations: Electronics & Computer Science
ePrint ID: 259817
Date :
Date Event
December 1993Published
Date Deposited: 24 Aug 2004
Last Modified: 17 Apr 2017 22:23
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/259817

Actions (login required)

View Item View Item