ctor associated with the winning neuron and the weighting vectors associated with

the neighboring neurons are refined, the latter being influenced differently
depending on the
size of the of the neighbourhood. The basic idea of the principle of proximity to
selforganization learning consists in introducing local interactions between the
neurons of the
network in the sense that the change in the behavior of a neuron directly affects
the behavior of
neurons in the immediate Neighbourhood. This local interaction leads, during the
learning
process, to a global order of the network, resulting in coherent behavior. Thus, if
the network
carries out mapping a set of input vectors X(k) R
n
in an array of neural units (commonly onedimensional or two-dimensional),
topological relationships between input data are preserved,
or, in other words, if Xi and Xj are two vectors in the input space and ri and rj
are the locations
of the corresponding winning neurons in the output space (neuron matrix), then the
closer Xi şi
Xj are in R
n
, the smaller the distance between the winning neuron