Using the Perceptron Algorithm to Find Consistent Hypotheses
1993 ◽
Vol 2
(4)
◽
pp. 385-387
◽
Keyword(s):
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.
1992 ◽
Vol 4
(4)
◽
pp. 265-279
1995 ◽
Vol 43
(7)
◽
pp. 1696-1702
◽
Keyword(s):
1999 ◽
Vol 8
(1)
◽
pp. 25-32
◽
Keyword(s):