Cart (Loading....) | Create Account
Close category search window
 

On modifications of Kohonen's feature map algorithm for an efficient parallel implementation

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

3 Author(s)
Vassilas, N. ; NCSR Demokritos, Greece ; Thiran, P. ; Tenne, P.

Two new variants of Kohonen's self-organizing feature maps based on batch processing are presented in this work. The purpose is to make available a finer grain of parallelism to be used in massively parallel systems. Ordering and convergence to asymptotic values for 1-D maps and 1-D continuous input and weight spaces are proved for both variants. Simulation on uniform 2-D data using 1-D and 2-D maps as well as simulations on 12-D speech data using 2-D maps are also presented to back the theoretical results

Published in:

Neural Networks, 1996., IEEE International Conference on  (Volume:2 )

Date of Conference:

3-6 Jun 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.