Article contents
Using the Perceptron Algorithm to Find Consistent Hypotheses
Published online by Cambridge University Press: 12 September 2008
Abstract
The perceptron learning algorithm quite naturally yields 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, in general, this algorithm is not efficient.
- Type
- Research Article
- Information
- Copyright
- Copyright © Cambridge University Press 1993
References
- 6
- Cited by