Kohonen's SOM with cache

Vishwanathan, SVN and Murty, Narasimha M (2000) Kohonen's SOM with cache. In: Pattern Recognition, 33 (11). pp. 1927-1929.

PDF Rapid_and_Brief_Communication.pdf Restricted to Registered users only Download (85kB) | Request a copy

Abstract

The Kohonen self-organizing map (SOM),is a topology-preserving map that maps data from higher dimensions onto a (typically) two-dimensional grid of lattice points [1]. The aim of self-organization is to generate a topology-preserving mapping, where the neighborhood relations in the input space are preserved as well as possible, in the neighborhood relations of the units of the map [2]. One of the most time consuming steps during the training of the SOM is the sub-problem of locating the winner node for a given sample. A winner node is the best matching unit for each input vector.

Item Type:	Journal Article
Publication:	Pattern Recognition
Publisher:	Elsevier
Additional Information:	Copyright of this article belongs to Elsevier.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	23 Jan 2007
Last Modified:	19 Sep 2010 04:30
URI:	http://eprints.iisc.ac.in/id/eprint/7900

Actions (login required)

View Item