**Self Organizing Map (or Kohonen Map or SOM)** is a type of Artificial Neural Network which is also inspired by biological models of neural systems form the 1970’s. It follows an unsupervised learning approach and trained its network through a competitive learning algorithm. SOM is used for clustering and mapping (or dimensionality reduction) techniques to map multidimensional data onto lower-dimensional which allows people to reduce complex problems for easy interpretation. SOM has two layers, one is the Input layer and the other one is the Output layer. The architecture of the Self Organizing Map with two clusters and n input features of any sample is given below:

### How SOM works?

Let’s say an input data of size (m, n) where m is the number of training example 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 :

w_{ij}= w_{ij}(old) - alpha(t) * (x_{i}^{k}- w_{ij}(old))

where alpha is a learning rate at time t, j denotes the winning vector, i denotes the i^{th} feature of training example and k denotes the k^{th} 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 vector.

### Algorithm

Steps involved are :

- Weight initialization
- For 1 to N number of epochs
- Select a training example
- Compute the winning vector
- Update the winning vector
- Repeat steps 3, 4, 5 for all training examples.
- Clustering the test sample

Below is the implementation of above approach:

`import` `math ` ` ` ` ` `class` `SOM : ` ` ` ` ` `# Function here computes the winning vector ` ` ` `# by Euclidean distance ` ` ` `def` `winner( ` `self` `, weights, sample ) : ` ` ` ` ` `D0 ` `=` `0` ` ` `D1 ` `=` `0` ` ` ` ` `for` `i ` `in` `range` `( ` `len` `( sample ) ) : ` ` ` ` ` `D0 ` `=` `D0 ` `+` `math.` `pow` `( ( sample[i] ` `-` `weights[` `0` `][i] ), ` `2` `) ` ` ` `D1 ` `=` `D1 ` `+` `math.` `pow` `( ( sample[i] ` `-` `weights[` `1` `][i] ), ` `2` `) ` ` ` ` ` `if` `D0 > D1 : ` ` ` `return` `0` ` ` `else` `: ` ` ` `return` `1` ` ` ` ` `# Function here updates the winning vector ` ` ` `def` `update( ` `self` `, weights, sample, J, alpha ) : ` ` ` ` ` `for` `i ` `in` `range` `( ` `len` `( weights ) ) : ` ` ` `weights[J][i] ` `=` `weights[J][i] ` `+` `alpha ` `*` `( sample[i] ` `-` `weights[J][i] ) ` ` ` ` ` `return` `weights ` ` ` `# Driver code ` `def` `main() : ` ` ` ` ` `# Training Examples ( m, n ) ` ` ` `T ` `=` `[ [ ` `1` `, ` `1` `, ` `0` `, ` `0` `], [ ` `0` `, ` `0` `, ` `0` `, ` `1` `], [ ` `1` `, ` `0` `, ` `0` `, ` `0` `], [ ` `0` `, ` `0` `, ` `1` `, ` `1` `] ] ` ` ` ` ` `m, n ` `=` `len` `( T ), ` `len` `( T[` `0` `] ) ` ` ` ` ` `# weight initialization ( n, C ) ` ` ` `weights ` `=` `[ [ ` `0.2` `, ` `0.6` `, ` `0.5` `, ` `0.9` `], [ ` `0.8` `, ` `0.4` `, ` `0.7` `, ` `0.3` `] ] ` ` ` ` ` `# training ` ` ` `ob ` `=` `SOM() ` ` ` ` ` `epochs ` `=` `3` ` ` `alpha ` `=` `0.5` ` ` ` ` `for` `i ` `in` `range` `( epochs ) : ` ` ` `for` `j ` `in` `range` `( m ) : ` ` ` ` ` `# training sample ` ` ` `sample ` `=` `T[j] ` ` ` ` ` `# Compute winner vector ` ` ` `J ` `=` `ob.winner( weights, sample ) ` ` ` ` ` `# Update winning vector ` ` ` `weights ` `=` `ob.update( weights, sample, J, alpha ) ` ` ` ` ` `# classify test sample ` ` ` `s ` `=` `[ ` `0` `, ` `0` `, ` `0` `, ` `1` `] ` ` ` `J ` `=` `ob.winner( weights, s ) ` ` ` ` ` `print` `( ` `"Test Sample s belongs to Cluster : "` `, J ) ` ` ` `print` `( ` `"Trained weights : "` `, weights ) ` ` ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` `main() ` |

*chevron_right*

*filter_none*

**Output:**

Test Sample s belongs to Cluster : 0

Trained weights : [[0.6000000000000001, 0.8, 0.5, 0.9], [0.3333984375, 0.0666015625, 0.7, 0.3]]

Attention geek! Strengthen your foundations with the **Python Programming Foundation** Course and learn the basics.

To begin with, your interview preparations Enhance your Data Structures concepts with the **Python DS** Course.

## Recommended Posts:

- Python | Get a google map image of specified location using Google Static Maps API
- Creating interactive maps and Geo Visualizations in Java
- Stamen Toner ,Stamen Terrain and Mapbox Bright Maps in Python-Folium
- Plotting ICMR approved test centers on Google Maps using folium package
- Python Bokeh – Plot for all Types of Google Maps ( roadmap, satellite, hybrid, terrain)
- Google Maps Selenium automation using Python
- self in Python class
- OpenCV and Keras | Traffic Sign Classification for Self-Driving Car
- Overview of Kalman Filter for Self-Driving Car
- ANN - Implementation of Self Organizing Neural Network (SONN) from Scratch
- Python Library for Self-Balancing BST
- Grouped Boxplots in Python with Seaborn
- Bulk Posting on Facebook Pages using Selenium
- Serializing JSON data in Python

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.