By Topic

An efficient multiprocessor mapping algorithm for the Kohonen feature map and its derivative models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Whittington, G. ; Dept. of Eng., Aberdeen Univ., UK ; Spracklen, C.T.

This paper explores the potential for utilising specialised hardware for the implementation of the Kohonen model and its derivative models. The adaptation periods of these algorithms is potentially protracted and computationally expensive; especially for the adaptive Kohonen model in real-world, online applications. This paper analyses these models and highlights inherent parallelism. This analysis forms the basis for examining the efficient implementation of these models using homogeneous, multiprocessor computing architectures. The commonly used “network to processor” mapping algorithm is shown to be suboptimal and an improved algorithm is proposed. The superiority of this new algorithm is demonstrated over the existing algorithms

Published in:

Neural Networks, 1994. IEEE World Congress on Computational Intelligence., 1994 IEEE International Conference on  (Volume:1 )

Date of Conference:

27 Jun-2 Jul 1994