![]() |
CiteULike | ![]() |
sirandreus's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
The perceptron algorithm versus winnow: linear versus logarithmic mistake bounds when few input variables are relevantby: J. Kivinen
|
Reviews
[Write a review of this article]
Notes for this articleThe experiment on the k-literal monotone disjunction demonstrated that:
- the smaller the number of relevant attributes the better does Winnow perform
- the opposite applies for the Perceptron
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
BibTeX record
RIS record