📕
The Hitchhiker's Guide to Machine Learning Algorit
  • README
    • Title Page
    • Introduction
    • Half Title
    • Authors
    • Dedication
    • Acknowledgements
    • Preface
    • Copyright
  • Chapters
    • Actor-critic
    • AdaBoost
    • Adadelta
    • Adagrad
    • Adam
    • Affinity Propagation
    • Apriori
    • Asynchronous Advantage Actor-Critic
    • Averaged One-Dependence Estimators
    • Back-Propagation
    • Bayesian Network
    • Boosting
    • Bootstrapped Aggregation
    • C5.0
    • CatBoost
    • Chi-squared Automatic Interaction Detection
    • Classification and Regression Tree
    • Conditional Decision Trees
    • Convolutional Neural Network
    • Decision Stump
    • Deep Belief Networks
    • Deep Boltzmann Machine
    • Deep Q-Network
    • Density-Based Spatial Clustering of Applications with Noise
    • Differential Evolution
    • Eclat
    • Elastic Net
    • Expectation Maximization
    • eXtreme Gradient Boosting
    • Flexible Discriminant Analysis
    • Gated Recurrent Unit
    • Gaussian Naive Bayes
    • Genetic
    • Gradient Boosted Regression Trees
    • Gradient Boosting Machines
    • Gradient Descent
    • Hidden Markov Models
    • Hierarchical Clustering
    • Hopfield Network
    • Independent Component Analysis
    • Isolation Forest
    • Iterative Dichotomiser 3
    • k-Means
    • k-Medians
    • k-Nearest Neighbor
    • Label Propagation Algorithm
    • Label Spreading
    • Latent Dirichlet Allocation
    • Learning Vector Quantization
    • Least Absolute Shrinkage and Selection Operator
    • Least-Angle Regression
    • LightGBM
    • Linear Discriminant Analysis
    • Linear Regression
    • Locally Estimated Scatterplot Smoothing
    • Locally Weighted Learning
    • Logistic Regression
    • Long Short-Term Memory Network
    • M5
    • Mini-Batch Gradient Descent
    • Mixture Discriminant Analysis
    • Momentum
    • Monte Carlo Tree Search
    • Multidimensional Scaling
    • Multilayer Perceptrons
    • Multinomial Naive Bayes
    • Multivariate Adaptive Regression Splines
    • Nadam
    • Naive Bayes
    • Ordinary Least Squares Regression
    • Partial Least Squares Regression
    • Particle Swarm Optimization
    • Perceptron
    • Policy Gradients
    • Principal Component Analysis
    • Principal Component Regression
    • Projection Pursuit
    • Proximal Policy Optimization
    • Q-learning
    • Quadratic Discriminant Analysis
    • Radial Basis Function Network
    • Random Forest
    • Recurrent Neural Network
    • Reinforcement Learning
    • Ridge Regression
    • RMSProp
    • Rotation Forest
    • Sammon Mapping
    • Self-Organizing Map
    • Semi-Supervised Support Vector Machines
    • Simulated Annealing
    • Spectral Clustering
    • Stacked Auto-Encoders
    • Stacked Generalization
    • State-Action-Reward-State-Action
    • Stepwise Regression
    • Stochastic Gradient Descent
    • Support Vector Machines
    • Support Vector Regression
    • t-Distributed Stochastic Neighbor Embedding
    • TD-Lambda
    • Weighted Average
Powered by GitBook
On this page
  • Self-Organizing Map: Introduction
  • Self-Organizing Map: Use Cases & Examples
  • Getting Started
  • FAQs
  • What is Self-Organizing Map (SOM)?
  • What is the abbreviation for Self-Organizing Map?
  • What is the type of Self-Organizing Map?
  • What learning method does Self-Organizing Map use?
  • What are the applications of Self-Organizing Map?
  • Self-Organizing Map: ELI5
  1. Chapters

Self-Organizing Map

PreviousSammon MappingNextSemi-Supervised Support Vector Machines

Last updated 1 year ago

The Self-Organizing Map (SOM), also known as Kohonen map, is a type of artificial neural network trained using unsupervised learning to produce low dimensional representation of the input space. It is an instance-based algorithm that falls into the category of unsupervised learning methods, where the network learns from unlabeled data. The SOM algorithm is commonly used for tasks such as data visualization, clustering, and feature extraction.

Self-Organizing Map: Introduction

Domains
Learning Methods
Type

Machine Learning

Unsupervised

Instance-based

The Self-Organizing Map (SOM) is a type of artificial neural network that is trained using unsupervised learning to produce low dimensional representation of the input space. The SOM algorithm is an instance-based approach that maps high-dimensional input data onto a low-dimensional grid, preserving the topology of the input space.

The SOM is a powerful tool for data visualization, clustering, and feature extraction, and has been successfully applied in a wide range of fields, including image and speech recognition, data mining, and bioinformatics. The unsupervised learning method used in SOM allows for automatic detection of patterns and relationships in the input data without the need for explicit labels or classifications.

With the ability to handle large datasets and identify complex patterns, the Self-Organizing Map has become a popular and widely used algorithm in the field of machine learning and artificial intelligence.

Through the use of SOM, engineers and researchers can gain valuable insights into the underlying structure and relationships within their data, leading to improved decision-making and problem-solving.

Self-Organizing Map: Use Cases & Examples

The Self-Organizing Map (SOM), also known as Kohonen map, is a type of artificial neural network that is trained using unsupervised learning to produce low dimensional representation of the input space. It was invented by Teuvo Kohonen in the early 1980s.

SOM has a wide range of use cases, including:

  • Image and signal processing: SOM can be used for image and signal compression, feature extraction, and image segmentation.

  • Data visualization: SOM can be used to visualize high-dimensional data in a low-dimensional space, making it easier to explore and understand.

  • Clustering: SOM can be used for clustering similar data points together in the low-dimensional space.

  • Recommendation systems: SOM can be used to classify and recommend items based on user behavior or preferences.

Getting Started

The Self-Organizing Map (SOM) is a type of artificial neural network that is trained using unsupervised learning to produce low dimensional representation of the input space. It is also known as Kohonen map, after its inventor Teuvo Kohonen. SOMs are instance-based and can be used for clustering, dimensionality reduction, and visualization of high-dimensional data.

To get started with SOM, you can use the MiniSom package in Python. MiniSom is a minimalistic and Numpy-based implementation of the SOM algorithm. Here's an example of how to use MiniSom to cluster a dataset:

import numpy as np
from minisom import MiniSom

# create a dataset
X = np.random.rand(100, 10)

# create a SOM with a 5x5 grid
som = MiniSom(5, 5, 10, sigma=1.0, learning_rate=0.5)

# train the SOM on the dataset
som.train_random(X, 100)

# get the cluster labels for each data point
labels = som.labels_map(X)

# print the cluster labels
print(labels)

FAQs

What is Self-Organizing Map (SOM)?

Self-Organizing Map (SOM) is a type of artificial neural network that is trained using unsupervised learning to produce low dimensional representation of the input space. It is also known as Kohonen map, after its inventor, Teuvo Kohonen.

What is the abbreviation for Self-Organizing Map?

The abbreviation for Self-Organizing Map is SOM.

What is the type of Self-Organizing Map?

Self-Organizing Map is an instance-based type of machine learning algorithm.

What learning method does Self-Organizing Map use?

Self-Organizing Map uses unsupervised learning method.

What are the applications of Self-Organizing Map?

Self-Organizing Map has been used in various fields including image recognition, speech recognition, data mining, and natural language processing. It can also be used for exploratory data analysis and visualization of high- dimensional data.

Self-Organizing Map: ELI5

The Self-Organizing Map (SOM) is like a detective that looks at all the clues and figures out how to group them together. It's a type of artificial neural network that can learn on its own without someone telling it what to do. Using unsupervised learning, SOM can take a large amount of data and find patterns within it, creating a low dimensional map that represents the important features.

Imagine you're moving into a new house and you have a lot of boxes to unpack. You start by organizing the boxes into groups based on where they should go in your house. The SOM algorithm does something similar. It takes a big pile of data and sorts it into groups based on similarities between the data points. Then it creates a map that helps visualize those groups so you can see how they relate to each other.

SOM is great for data visualization, pattern recognition, and data compression. It helps us understand complex data by simplifying it and allowing us to look at it in a more manageable way.

If you're interested in learning more about artificial neural networks, SOM is a great place to start.

Key takeaways:

  • The Self-Organizing Map (SOM) is an instance-based algorithm that uses unsupervised learning to create a low dimensional map of a large dataset.

  • It works by grouping together similar data points and creating a visual representation of those groups so we can better understand the patterns in the data.

  • SOM is useful for data visualization, pattern recognition, and data compression.

*[MCTS]: Monte Carlo Tree Search

Self Organizing Map