# Difference between revisions of "Sanger's rule"

Line 1: | Line 1: | ||

+ | <translate> | ||

+ | |||

'''Sanger's rule''', also known as '''sequential principal components analysis''', developed by American neurologist Terence Sanger in 1985, is a version of [[Oja's rule]] which forces neurons to represent a well-ordered set of principal components of the data set.<ref name="Sanger89">Sanger, Terence D. (1989). [http://ece-classweb.ucsd.edu/winter06/ece173/documents/Sanger%201989%20--%20Optimal%20Unsupervised%20Learning%20in%20a%20Single-layer%20Linear%20FeedforwardNN.pdf "Optimal unsupervised learning in a single-layer linear feedforward neural network"] <em>Neural Networks</em> <strong>2</strong> (6): 459–473</ref> | '''Sanger's rule''', also known as '''sequential principal components analysis''', developed by American neurologist Terence Sanger in 1985, is a version of [[Oja's rule]] which forces neurons to represent a well-ordered set of principal components of the data set.<ref name="Sanger89">Sanger, Terence D. (1989). [http://ece-classweb.ucsd.edu/winter06/ece173/documents/Sanger%201989%20--%20Optimal%20Unsupervised%20Learning%20in%20a%20Single-layer%20Linear%20FeedforwardNN.pdf "Optimal unsupervised learning in a single-layer linear feedforward neural network"] <em>Neural Networks</em> <strong>2</strong> (6): 459–473</ref> | ||

Line 25: | Line 27: | ||

[[Category: Neural computational models]] | [[Category: Neural computational models]] | ||

+ | |||

+ | </translate> |

## Latest revision as of 03:28, 24 June 2016

**Sanger's rule**, also known as **sequential principal components analysis**, developed by American neurologist Terence Sanger in 1985, is a version of Oja's rule which forces neurons to represent a well-ordered set of principal components of the data set.^{[1]}

## Model

We use a set of linear neurons. Given a set of k-dimensional inputs represented as a column vector , and a set of *m* linear neurons with (initially random) synaptic weights from the inputs, represented as a matrix formed by *m* weight column vectors (i.e. a *k* row x *m* column matrix):

where is the weight between input *i* and neuron *j*, the output of the set of neurons is defined as follows:

Sanger's rule gives the update rule which is applied after an input pattern is presented:

Sanger's rule is simply Oja's rule except that instead of a subtractive contribution from all neurons, the subtractive contribution is only from "previous" neurons. Thus, the first neuron is a purely Oja's rule neuron, and extracts the first principal component. The second neuron, however, is forced to find some other principal component due to the subtractive contribution of the first and second neurons. This leads to a well-ordered set of principal components.

The only problem is that while it is true that the entire input set *can* be constructed from one primary principal component, one secondary principal component, and so on, the components themselves are not necessarily *meaningful*. Rather than the entire set, there may only be *subsets* of the input set for which principal components analysis over each subset makes sense. This insight leads to Conditional principal components analysis.^{[2]}

## References

- ↑ Sanger, Terence D. (1989). "Optimal unsupervised learning in a single-layer linear feedforward neural network"
*Neural Networks***2**(6): 459–473 - ↑ O'Reilly, Randall C.; Munakata, Yuko (2000).
*Computational Explorations in Cognitive Neuroscience: Understanding the Mind by Simulating the Brain*ISBN 978-0262650540