Shift-invariant similarities circumvent distance concentration in stochastic neighbor embedding and variants
(2011) 2011 International Conference on Computational Science (ICCS 2011) — Location: Singapore (1.June.2011)
Files
iccs11jl.pdf
Restricted Access - Adobe PDF
- 315.6 KB
Details
- Authors
- Abstract
- Dimensionality reduction aims at representing high-dimensional data in low-dimensional spaces, mainly for visualization and exploratory purposes. As an alternative to projections on linear subspaces, nonlinear dimensionality reduction, also known as manifold learning, can provide data representations that preserve structural properties such as pairwise distances or local neighborhoods. Very recently, similarity preservation emerged as a new paradigm for dimensionality reduction, with methods such as stochastic neighbor embedding and its variants. Experimentally, these methods significantly outperform the more classical methods based on distance or transformed distance preservation. This paper explains both theoretically and experimentally the reasons for these performances. In particular, it details why the phenonomenon of distance concentration is an impediment towards effcient dimensionality reduction and how SNE and its variants circumvent this diffculty by using similarities that are invariant to shifts with respect to squared distances. The paper also proposes a generalized definition of shift-invariant similarities that extend the applicability of SNE to noisy data.
- Affiliations
Citations
Lee, J., & Verleysen, M. (2011). Shift-invariant similarities circumvent distance concentration in stochastic neighbor embedding and variants. Procedia Computer Science, 4, 538-547. https://doi.org/10.1016/j.procs.2011.04.056 (Original work published 2011)