A Result of Vapnik with Applications
Anthony, M. and Shawe-Taylor, J. (1993) A Result of Vapnik with Applications. Discrete Applied Mathematics, 47, (3), 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.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science
|Date Deposited:||24 Aug 2004|
|Last Modified:||02 Mar 2012 13:42|
|Contributors:||Anthony, M. (Author)
Shawe-Taylor, J. (Author)
|Further Information:||Google Scholar|
|ISI Citation Count:||22|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)