Related Experiment Video
Updated: Jul 7, 2026

Open-source Single-particle Analysis for Super-resolution Microscopy with VirusMapper
Published on: April 9, 2017
Self-organizing maps, vector quantization, and mixture modeling
1RWCP Theoretical Foundation SNN, University of Nijmegen, Nijmegen 6252 EZ, The Netherlands. tom@mbfys.kun.nl
Abstract:
Self-organizing maps are popular algorithms for unsupervised learning and data visualization. Exploiting the link between vector quantization and mixture modeling, we derive expectation-maximization (EM) algorithms for self-organizing maps with and without missing values. We compare self-organizing maps with the elastic-net approach and explain why the former is better suited for the visualization of high-dimensional data. Several extensions and improvements are discussed. As an illustration we apply a self-organizing map based on a multinomial distribution to market basket analysis.
Related Concept Videos
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...
Vector Algebra: Graphical Method
We use the laws of geometry to construct resultant vectors, followed by trigonometry to find vector magnitudes and directions. For a geometric construction of the sum of two vectors in a plane, we follow the parallelogram rule. Suppose two vectors are at arbitrary positions. Translate either one of...
Conservative Vector Fields
Multi-input and Multi-variable systems
In the absence of...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Vectors in Space: Problem Solving
