On the Emulation of Kohonen's Self-Organization via Single-Map Metropolis-Hastings Algorithms

  • Authors:
  • Jorge Muruzábal

  • Affiliations:
  • -

  • Venue:
  • ICCS '01 Proceedings of the International Conference on Computational Science-Part II
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

As data sets get larger and larger, the need for exploratory methods that allow some visualization of the overall structure in the data is becoming more important. The self-organizing map (SOM) introduced by Kohonen is a powerful tool for precisely this purpose. In recent years, SOM-based methodology has been refined and deployed with success in various high-dimensional problems. Still, our understanding of the properties of SOMs fitted by Kohonen's original algorithm is not complete, and several statistical models and alternative fitting algorithms have been devised in the literature. This paper presents a new Metropolis-Hastings Markov chain Monte Carlo algorithm designed for SOM fitting. The method stems from both the previous success of bayesian machinery in neural models and the uprise of computer-intensive, simulation-based algorithms in bayesian inference. Experimental results suggest the feasibility as well as the limitations of the approach in its current form. Since the method is based on a few extremely simple chain transition kernels, the framework may well accommodate the more sophisticated constructs needed for a full emulation of the self-organization treat.