By Topic

Performance Evaluation of Different Kohenen Network Parallelization Techniques

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

4 Author(s)
Kwiatkowski, J. ; Inst. of Appl. Informatics, Wroclaw Univ. of Technol. ; Pawlik, M. ; Markowska-Kaczmar, U. ; Konieczny, D.

The Kohonen feature maps are commonly employed to process large input data but their effective working abilities can be achieved only after a time-consuming process of learning. Performed tests have shown that the sequential program, solving a typical problem, uses more than 95 percent of its time to localize the winners. The aim of the paper is to present and compare different ways of the algorithm parallelization. We compare two different classes of parallel implementations - the network parallelization and the learning set parallelization. During performed experiments two different ways of experimental evaluation are used: standard evaluation based on such metrics as speedup and efficiency and the approximation method based on the granularity concept

Published in:

Parallel Computing in Electrical Engineering, 2006. PAR ELEC 2006. International Symposium on

Date of Conference:

13-17 Sept. 2006