For the latest version of JMP Help, visit

Multivariate Methods > K Means Cluster > Self Organizing Map > Description of SOM Algorithm
Publication date: 11/10/2021

Description of SOM Algorithm

This section contains the steps of the SOM implementation in JMP.

Initial cluster seeds are selected in a way that provides a good coverage of the multidimensional space. JMP uses principal components to determine the two directions that capture the most variation in the data.

JMP then lays out a grid in this principal component space with its edges 2.5 standard deviations from the middle in each direction. The clusters seeds are determined by translating this grid back into the original space of the variables.

The cluster assignment proceeds as with k-means. Each point is assigned to the cluster closest to it.

The means are estimated for each cluster as in k-means. JMP then uses these means to set up a weighted regression with each variable as the response in the regression, and the SOM grid coordinates as the regressors. The weighting function uses a kernel function that gives large weight to the cluster whose center is being estimated. Smaller weights are given to clusters farther away from the cluster in the SOM grid. The new cluster means are the predicted values from this regression.

These iterations proceed until the process has converged.

Want more information? Have questions? Get answers in the JMP User Community (