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.
Download
Full text not available from this repository.
Description/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.
| Item Type: | Article |
|---|---|
| ISSNs: | 0166-218X |
| Divisions: | Faculty of Physical Sciences and Engineering > Electronics and Computer Science |
| Item ID: | 259817 |
| Date Deposited: | 24 Aug 2004 |
| Last Modified: | 02 Mar 2012 13:42 |
| Contributors: | Anthony, M. (Author) Shawe-Taylor, J. (Author) |
| Date: | December 1993 |
| Status: | Published |
| Further Information: | Google Scholar |
| ISI Citation Count: | 22 |
| URI: | http://eprints.soton.ac.uk/id/eprint/259817 |
Actions (login required)
 |
View Item |
