Scribd
Upload
12 views

Self Organizing Maps

Uploaded by

mk7174572
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
12 views

Self Organizing Maps

Uploaded by

mk7174572
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Self-Organizing Maps

GROUP 3
SHAMSA AZAM
IQRA SHAHEEN
ROLL NO.
F22BARIN1E02012
F22BARIN1E02038
Self-Organizing Maps
 The Self Organizing Map is one of the most popular neural models.
It belongs to the category of the competitive learning network. The
SOM is based on unsupervised learning, which means that is no
human intervention is needed during the training and those little
needs to be known about characterized by the input data. We could,
for example, use the SOM for clustering membership of the input
data. The SOM can be used to detect features inherent to the
problem and thus has also been called SOFM the Self Origination
Feature Map.
 The purpose of SOM is that it’s providing a data visualization
technique that helps to understand high dimensional data by
reducing the dimension of data to map. SOM also represents the
clustering concept by grouping similar data together.
Therefore it can be said that Self Organizing Map reduces data
dimension and displays similarly among data. The figure below is a
rough illustration of the structure of the SOM:
Traveling Salesman Problem
 The Traveling Salesman Problem is a well known challenge in Computer
Science: it consists on finding the shortest route possible that traverses all
cities in a given map only once.
 The original paper released by Teuvo Kohonen in 1998 consists on a
brief, masterful description of the technique. In there, it is explained
that a self-organizing map is described as an (usually two-
dimensional) grid of nodes, inspired in a neural network. Closely
related to the map, is the idea of the model, that is, the real world
observation the map is trying to represent. The purpose of the
technique is to represent the model with a lower number of
dimensions, while maintaining the relations of similarity of the
nodes contained in it.
 To capture this similarity, the nodes in the map are spatially
organized to be closer the more similar they are with each other.
How do SOM works
 Let’s say an input data of size (m, n) where m is the number of training examples
and n is the number of features in each example. First, it initializes the weights of
size (n, C) where C is the number of clusters. Then iterating over the input data,
for each training example, it updates the winning vector (weight vector with the
shortest distance (e.g Euclidean distance) from training example). Weight
updation rule is given by :

 where alpha is a learning rate at time t, j denotes the winning vector, i denotes the
ith feature of training example and k denotes the kth training example from the
input data. After training the SOM network, trained weights are used for
clustering new examples. A new example falls in the cluster of winning vectors.
Algorithm
 Training:
 Step 1: Initialize the weights wij random value may be assumed. Initialize the
learning rate α.
 Step 2: Calculate squared Euclidean distance.
 D(j) = Σ (wij – xi)^2 where i=1 to n and j=1 to m
 Step 3: Find index J, when D(j) is minimum that will be considered as winning
index.
 Step 4: For each j within a specific neighborhood of j and for all i, calculate the
new weight.
 wij(new)=wij(old) + α[xi – wij(old)].
 Step 5: Update the learning rule by using :
 α(t+1) = 0.5 * t.
 Step 6: Test the Stopping Condition.

You might also like