Self-organizing map
A self-organizing map is an unsupervised neural model that maps high-dimensional data onto a usually lower-dimensional grid while preserving neighborhood relationships.
Build AI Drug Discovery Pipelines
A self-organizing map is an unsupervised neural-network technique that maps high-dimensional data onto a lower-dimensional grid while preserving neighborhood relationships.
- How it is used
- Visualizes high-dimensional chemical space and supports unsupervised hit discovery in drug repurposing.
- How deep it goes
- Explains grid initialization, BMU selection, neighborhood updates, topology visualization, and hyperparameter search without detailing full implementation.
- Examples
- Uses RGB-colored beads, 2,048-dimensional molecular fingerprints, activity-enriched nodes, U-MAT maps, and Drug Repurposing Hub compounds.
- What you can do after
- Apply it via MiniSom to map fingerprints, label nodes by activity, and prioritize unseen compounds near active regions.
Read how Build AI Drug Discovery Pipelines explains self-organizing map →
Optimization Algorithms: AI techniques for design, planning, and control problems
A self-organizing map is an unsupervised neural model that maps high-dimensional data onto a usually low-dimensional topology-preserving grid of units.
- How it is used
- Applies unsupervised competitive learning to represent high-dimensional data on a low-dimensional map and approximate optimization routes.
- How deep it goes
- Explains BMU selection, neighborhood updates, bandwidth effects, pseudocode, and tuning, without presenting formal proofs.
- Examples
- Demonstrates route construction for the Qatar qa194.tsp instance with custom Python code and MiniSom.
- What you can do after
- Apply SOM training to map data or approximate a TSP route, then tune neurons, sigma, learning rate, and iterations.
What to know first
- dimensionality reductionDimensionality reduction transforms data into a representation with fewer dimensions while attempting to retain relevant information or structure.
- Euclidean distanceEuclidean distance is the straight-line distance between two points, calculated as the square root of the sum of squared differences between corresponding coordinates.
Related concepts
- language modelkind of · A language model is a computational model that represents patterns in linguistic sequences to assign probabilities, predict, generate, or evaluate language.
- neighborhood functionhas part · A neighborhood function assigns learning influence to units according to their distance from a winning unit in a self-organizing map.
- Gaussian neighborhood functionuses · A Gaussian neighborhood function assigns larger update strengths to nodes nearer the best matching unit and smaller strengths to nodes farther away according to a Gaussian profile.
- quantization errormeasured by · Quantization error is the discrepancy between a value and its approximation when it is represented using a limited or discrete set of values.
- topographic errormeasured by · Topographic error is the proportion of inputs whose first and second best matching units are not adjacent on a self-organizing map.
Questions about self-organizing map
What is self-organizing map?
A self-organizing map is an unsupervised neural model that maps high-dimensional data onto a usually lower-dimensional grid while preserving neighborhood relationships.
Which Manning books explain self-organizing map?
Build AI Drug Discovery Pipelines and Optimization Algorithms: AI techniques for design, planning, and control problems.
What should I know before learning self-organizing map?
Manning books that teach self-organizing map usually introduce dimensionality reduction and Euclidean distance first.
What is self-organizing map a kind of?
Self-organizing map is a kind of language model. A language model is a computational model that represents patterns in linguistic sequences to assign probabilities, predict, generate, or evaluate language.
What are the parts of self-organizing map?
Self-organizing map includes neighborhood function.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.

