Ordering of Self-Organizing Maps in Multi-Dimensional Cases
Abstract
It has been proved that in one-dimensional cases, the weights of Kohonen's self-organizing maps (SOM) will become ordered with probability 1; once the weights are ordered, they cannot become disordered in future training. It is difficult to analyze Kohonen's SOMs in multidimensional cases; however, it has been conjectured that similar results seem to be obtainable in multidimensional cases. In this note, we show that in multidimensional cases, even though the weights are ordered at some time, it is possible that they become disordered in the future.
Cite
Text
Huang et al. "Ordering of Self-Organizing Maps in Multi-Dimensional Cases." Neural Computation, 1998. doi:10.1162/089976698300017872Markdown
[Huang et al. "Ordering of Self-Organizing Maps in Multi-Dimensional Cases." Neural Computation, 1998.](https://mlanthology.org/neco/1998/huang1998neco-ordering/) doi:10.1162/089976698300017872BibTeX
@article{huang1998neco-ordering,
title = {{Ordering of Self-Organizing Maps in Multi-Dimensional Cases}},
author = {Huang, Guang-Bin and Babri, Haroon A. and Li, Hua-Tian},
journal = {Neural Computation},
year = {1998},
pages = {19-24},
doi = {10.1162/089976698300017872},
volume = {10},
url = {https://mlanthology.org/neco/1998/huang1998neco-ordering/}
}