Analysing a Self-organising Algorithm.
A self-organising algorithm is described, which is a generalisation of an algorithm proposed by Cottrell and Fort. The algorithm is analysed in a more general fashion using the ordinary differential equation method (ODE) of stochastic approximation theory. The results is a set of linear equations which the stationary state of the neuron weights must satisfy. Several features of the algorithm are analysed including the conditions necessary for the existence of a single stationary point as well as the configuration of the stationary state. It is shown what conditions favour the convergence of the neuron weights towards an organised configuration. Copyright 1997 Elsevier Science Ltd.
Flanagan
John A.
JA
Swiss Federal Institute of Technology, Switzerland