T-distributed Stochastic Neighbor Embedding (t-SNE) has become an extremely popular algorithm for low- dimensional visualization of high dimensional data. While it is acknowledged that it is highly sensitive to its parameters, it continues to be used extensively by the machine learning community, with `intuition' an accepted basis for embedding selection. In this paper, we will illustrate and explain why t-SNE is not a distance preserving algorithm, but rather order preserving, with the cardinality of the order proportional to the perplexity parameter. We compare and contrast t-SNE with Sammon Nonlinear Mappings locally using Kruskal Stress and Spearman Rank Correlation measures.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.