Jump to content

Winnow (algorithm)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Winterstein (talk | contribs) at 16:58, 9 August 2007 (Created stub entry). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The winnow algorithm is a technique from machine learning. It is closely related to the Perceptron, but uses a different update rule. Winnow is effective at removing unhelpful dimensions (hence it's name). It is not a sophisticated algorithm but it scales well to high-dimensional spaces. During training, winnow is shown a sequence of positive and negative examples. From these it learns a decision hyperplane.

The update rule is (loosely):

  • If an example is correctly classified, do nothing.
  • If an example is incorrectly classified, double or halve all weights involved in the mistake.

Variations are also used.