Jump to content

Winnow (algorithm)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Oreo Priest (talk | contribs) at 02:41, 14 March 2008 (Undid revision 198088315 by 99.250.127.145 (talk)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 its 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.