Self-organization as an iterative kernel smoothing process.

F. Mulier, V. Cherkassky

Research output: Contribution to journalArticlepeer-review

93 Scopus citations


Kohonen's self-organizing map, when described in a batch processing mode, can be interpreted as a statistical kernel smoothing problem. The batch SOM algorithm consists of two steps. First, the training data are partitioned according to the Voronoi regions of the map unit locations. Second, the units are updated by taking weighted centroids of the data falling into the Voronoi regions, with the weighing function given by the neighborhood. Then, the neighborhood width is decreased and steps 1, 2 are repeated. The second step can be interpreted as a statistical kernel smoothing problem where the neighborhood function corresponds to the kernel and neighborhood width corresponds to kernel span. To determine the new unit locations, kernel smoothing is applied to the centroids of the Voronoi regions in the topological space. This interpretation leads to some new insights concerning the role of the neighborhood and dimensionality reduction. It also strengthens the algorithm's connection with the Principal Curve algorithm. A generalized self-organizing algorithm is proposed, where the kernel smoothing step is replaced with an arbitrary nonparametric regression method.

Original languageEnglish (US)
Pages (from-to)1165-1177
Number of pages13
JournalNeural computation
Issue number6
StatePublished - Nov 1995


Dive into the research topics of 'Self-organization as an iterative kernel smoothing process.'. Together they form a unique fingerprint.

Cite this