Speed up of the SAMANN neural network retraining

Authors:
Viktor Medvedev;Gintautas Dzemyda
Affiliations:
Institute of Mathematics and Informatics, Vilnius, Lithuania;Institute of Mathematics and Informatics, Vilnius, Lithuania
Venue:
ICAISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Soft Computing
Year:
2006

Citing 8
Cited 0

Algorithms for clustering data

Algorithms for clustering data
Sammon's mapping using neural networks: a comparison

Pattern Recognition Letters - special issue on pattern recognition in practice V
Statistical Pattern Recognition: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence
Visualization of a set of parameters characterized by their correlation matrix

Computational Statistics & Data Analysis
Self-Organizing Maps

Self-Organizing Maps
Optimization of the Local Search in the Training for SAMANN Neural Network

Journal of Global Optimization
A Nonlinear Mapping for Data Structure Analysis

IEEE Transactions on Computers
Artificial neural networks for feature extraction and multivariate data projection

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sammon's mapping is a well-known procedure for mapping data from a higher-dimensional space onto a lower-dimensional one. The original algorithm has a disadvantage. It lacks generalization, which means that new points cannot be added to the obtained map without recalculating it. SAMANN neural network, that realizes Sammon's algorithm, provides a generalization capability of projecting new data. Speed up of the SAMANN network retraining when the new data points appear has been analyzed in this paper. Two strategies for retraining the neural network that realizes the multidimensional data visualization have been proposed and then the analysis has been made.