Mapping error in the parallel realizations of SAMANN algorithm
In this paper we discuss the visualization of multidimensional vectors. A well-known procedure for mapping data from a high-dimensional space onto a lower-dimensional one is Sammon's mapping. This algorithm preserves as well as possible all inter-pattern distances. We investigate an unsupervi...
Saved in:
Main Authors: | Viktor Medvedev, Gintautas Dzemyda |
---|---|
Format: | Article |
Language: | English |
Published: |
Vilnius University Press
2004-12-01
|
Series: | Lietuvos Matematikos Rinkinys |
Subjects: | |
Online Access: | https://www.journals.vu.lt/LMR/article/view/32221 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimization of the learning rate in the algorithm for data visualization
by: Viktor Medvedev, et al.
Published: (2005-12-01) -
Strategies of minimization of Sammon's mapping error
by: Gintautas Dzemyda, et al.
Published: (2004-12-01) -
Parallelization in combining the SOM and Sammon's mapping
by: Gintautas Dzemyda, et al.
Published: (2003-12-01) -
The temolate for parallel branch algorithm
by: Milda Baravykaitė
Published: (2004-12-01) -
Parallelized SLAM: Enhancing Mapping and Localization Through Concurrent Processing
by: Francisco J. Romero-Ramirez, et al.
Published: (2025-01-01)