Stochastic Neighbor Embedding
We describe a probabilistic approach to the task of placing objects, de- scribed by high-dimensional vectors or by pairwise dissimilarities, in a low-dimensional space in a way that preserves neighbor identities. A Gaussian is centered on each object in the high-dimensional space and the densities under this Gaussian (or the given dissimilarities) are used to define a probability distribution over all the potential neighbors of the object. The aim of the embedding is to approximate this distribu- tion as well as possible when the same operation is performed on the low-dimensional “images” of the objects. A natural cost function is a sum of Kullback-Leibler divergences, one per object, which leads to a simple gradient for adjusting the positions of the low-dimensional im- ages. Unlike other dimensionality reduction methods, this probabilistic framework makes it easy to represent each object by a mixture of widely separated low-dimensional images. This allows ambiguous objects, like the document count vector for the word “bank”, to have versions close to the images of both “river” and “finance” without forcing the images of outdoor concepts to be located close to those of corporate concepts.
Code (1)
Tasks
Dimensionality ReductionObjectSimilar Papers 제목 키워드 기반
DR-SNE: Density-Regularized Stochastic Neighbor Embedding
Dimensionality-reduction methods such as t-SNE preserve local neighborhood structure but can substantially distort the local distribution of data. We introduce Density-Regularized Stochastic Neighbor Embedding (DR-SNE), …
Dimensionality ReductionAnomaly DetectionStochastic Cluster Embedding
Neighbor Embedding (NE) aims to preserve pairwise similarities between data items and has been shown to yield an effective principle for data visualization. However, even the best existing NE methods such as Stochastic N…
Data VisualizationStochastic Neighbor Embedding separates well-separated clusters
Stochastic Neighbor Embedding and its variants are widely used dimensionality reduction techniques -- despite their popularity, no theoretical results are known. We prove that the optimal SNE embedding of well-separated …
Dimensionality ReductionStochastic Neighbor Embedding with Gaussian and Student-t Distributions: Tutorial and Survey
Stochastic Neighbor Embedding (SNE) is a manifold learning and dimensionality reduction method with a probabilistic approach. In SNE, every point is consider to be the neighbor of all other points with some probability a…
Dimensionality ReductionSupervised Stochastic Neighbor Embedding Using Contrastive Learning
Stochastic neighbor embedding (SNE) methods $t$-SNE, UMAP are two most popular dimensionality reduction methods for data visualization. Contrastive learning, especially self-supervised contrastive learning (SSCL), has sh…
Contrastive LearningData VisualizationDimensionality Reduction