Winnow (algorithm)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by JonathanWilliford (talk | contribs) at 20:55, 14 September 2008. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The winnow algorithm [1] is a technique from machine learning. It is closely related to the Perceptron, but it uses a multiplicative weight-update scheme that allows it perform much better than the perceptron when many dimensions are irrelevant (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.

  1. ^ Littlestone, N. (1988) Learning Quickly When Irrelevant Attributes About: A New Linear-threshold Algorithm Machine Learning 285-318(2)