Using the Perceptron Algorithm to Find Consistent Hypotheses
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
1993.
|
| Subjects: | |
| Online Access: | Get fulltext |