Anthony, M. and Shawe-Taylor, J. (1993) A Result of Vapnik with Applications. Discrete Applied Mathematics, 47 (3), 207-217.
Record type:
Article
Abstract
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.
This record has no associated files available for download.
More information
Published date: December 1993
Organisations:
Electronics & Computer Science
Identifiers
Local EPrints ID: 259817
URI: http://eprints.soton.ac.uk/id/eprint/259817
ISSN: 0166-218X
PURE UUID: cb3fcc9b-9703-480c-ab54-baabcbc7d208
Catalogue record
Date deposited: 24 Aug 2004
Last modified: 10 Dec 2021 21:06
Export record
Contributors
Author:
M. Anthony
Author:
J. Shawe-Taylor
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.