Using the Perceptron Algorithm to Find Consistent Hypotheses


Anthony, M. and Shawe-Taylor, J. (1993) Using the Perceptron Algorithm to Find Consistent Hypotheses Combinatorics, Probability and Computing, 2, pp. 385-387.

Download

[img] PDF percep.pdf - Other
Download (103kB)

Description/Abstract

The perceptron learning algorithm yields quite naturally an algorithm for finding a linearly separable boolean function consistent with a sample of such a function. Using the idea of a specifying sample, we give a simple proof that this algorithm is not efficient, in general.

Item Type: Article
Organisations: Electronics & Computer Science
ePrint ID: 259818
Date :
Date Event
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/259818

Actions (login required)

View Item View Item