Topological Continuous Map Algorithm

From GM-RKB
Revision as of 20:42, 23 December 2019 by Replacement Bot (talk | contribs) (Remove links to pages that are actually redirects to this page.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A Topological Continuous Map Algorithm is a Dimensionality Reduction Algorithm that ...



References

2002

  • (Fodor, 2002) ⇒ Imola K. Fodor. (2002). “A Survey of Dimension Reduction Techniques." LLNL technical report, UCRL ID-148494
    • There are several methods based on finding a continuous map to transform a high-dimensional data into a lower-dimensional lattice (latent) space of ¯xed dimension [7]. Such techniques could be called self-organizing maps, but that name is most often associated with one particular such method, namely, Kohonen's self-organizing maps. To avoid confusion, we follow the review [7], and refer to these methods collectively as methods that use topologically continuous maps.