Arikah Map

GSOM

GSOM stands for the Growing Self Organizing Map. It is a growing variant of the popular Self Organizing Map (SOM). The GSOM was developed to address the issue of identifying a suitable map size in the SOM. It starts with a minimal number of nodes (usually 4) and grows new nodes on the boundary based on a heuristic. By using the value called Spread Factor (SF), the data analyst has the ability to control the growth of the GSOM.

All the starting nodes of the GSOM are boundary nodes, i.e. each node has the freedom to grow on its own direction at the beginning. (Fig. 1) New Nodes are grown from the boundary nodes. Once a node is selected for growing all its free neighboring positions will be grown new nodes. The figure shows the three possible node growth options for a rectangular GSOM.

GSOM:Node growth options in GSOM: (a) one new node, (b) two new nodes and (c) three new nodes.
Enlarge
Node growth options in GSOM: (a) one new node, (b) two new nodes and (c) three new nodes.

Contents

The Algorithm

The GSOM process is as follows:

  1. Initialization phase:
    1. Initialize the weight vectors of the starting nodes (usually four) with random numbers between 0 and 1.
    2. Calculate the growth threshold (<math>GT</math>) for the given data set of dimension <math>D</math> according to the spread factor (<math>SF</math>) using the formula <math>GT = - D \times ln ( SF )</math>
  2. Growing Phase:
    1. Present input to the network.
    2. Determine the weight vector that is closest to the input vector mapped to the current feature map (winner), using Euclidean distance (similar to the SOM). This step can be summarized as: find <math>q'</math> such that <math>\left | v - w_{q'} \right \vert \le \left | v - w_q \right \vert \forall q \in \mathbb{N}</math> where <math>v</math>, <math>w</math> are the input and weight vectors respectively, <math>q</math> is the position vector for nodes and <math>\mathbb{N}</math> is the set of natural numbers.
    3. The weight vector adaptation is applied only to the neighborhood of the winner and the winner itself. The neighborhood is a set of neurons around the winner, but in the GSOM the starting neighborhood selected for weight adaptation is smaller compared to the SOM (localized weight adaptation). The amount of adaptation (learning rate) is also reduced exponentially over the iterations. Even within the neighborhood, weights that are closer to the winner are adapted more than those further away. The weight adaptation can be described by <math>w_j ( k + 1 ) = \begin{cases} w_j ( k ) & \mbox{if}j \notin \Nu_{k+1} \\ w_j ( k ) + LR ( k ) \times (x_k - w_j ( k ) ) & \mbox{if}j \in \Nu_{k+1} \end{cases}</math> where the Learning Rate <math>LR ( k )</math>, <math>k \in \mathbb{N}</math> is a sequence of positive parameters converging to zero as <math>k \to \infty</math>. <math>w_j ( k )</math>, <math>w_j ( k + 1 )</math> are the weight vectors of the node <math>j</math> before and after the adaptation and <math>\Nu_{k+1}</math> is the neighbourhood of the winning neuron at the <math>( k + 1 )</math>th iteration. The decreasing value of <math>LR ( k )</math> in the GSOM depends on the number of nodes existing in the map at time <math>k</math>.
    4. Increase the error value of the winner (error value is the difference between the input vector and the weight vectors).
    5. When <math>TE_i \; GT</math>(where <math>TE_i</math> is the total error of node <math>i</math> and <math>GT</math> is the growth threshold). Grow nodes if i is a boundary node. Distribute weights to neighbors if <math>i</math> is a non-boundary node.
    6. Initialize the new node weight vectors to match the neighboring node weights.
    7. Initialize the learning rate (<math>LR</math>) to its starting value.
    8. Repeat steps 2 – 7 until all inputs have been presented and node growth is reduced to a minimum level.
  3. Smoothing phase.
    1. Reduce learning rate and fix a small starting neighborhood.
    2. Find winner and adapt the weights of the winner and neighbors in the same way as in growing phase.

Bibliography

  1. Alahakoon, D., Halgamuge, S. K. and Sirinivasan, B. (2000) Dynamic Self Organizing Maps With Controlled Growth for Knowledge Discovery, IEEE Transactions on Neural Networks, Special Issue on Knowledge Discovery and Data Mining, 11, pp 601-614.
  2. Alahakoon, D., Halgamuge, S. K. and Sirinivasan, B. (1998) A Structure Adapting Feature Map for Optimal Cluster Representation in Proceedings of The 5th International Conference on Neural Information Processing (ICONIP 98), Kitakyushu, Japan, pp 809-812
  3. Alahakoon, D., Halgamuge, S. K. and Sirinivasan, B. (1998) A Self Growing Cluster Development Approach to Data Mining in Proceedings of IEEE International Conference on Systems, Man and Cybernetics, San Diego, USA, pp 2901-2906
  4. Alahakoon, D. and Halgamuge, S. K. (1998) Knowledge Discovery with Supervised and Unsupervised Self Evolving Neural Networks in Proceedings of 5th International Conference on Soft Computing and Information/Intelligent Systems, Fukuoka, Japan, pp 907-910

See also

Categories


Machine learning | Neural networks

Find

Find

Find