Embedding Neighborhoods Simultaneously t-SNE (ENS-t-SNE)

05/24/2022
by   Vahan Huroyan, et al.
0

We propose an algorithm for visualizing a dataset by embedding it in 3-dimensional Euclidean space based on various given distances between the same pairs of datapoints. Its aim is to find an Embedding which preserves Neighborhoods Simultaneously for all given distances by generalizing the t-Stochastic Neighborhood Embedding approach (ENS-t-SNE). We illustrate the utility of ENS-t-SNE by demonstrating its use in three applications. First, to visualize different notions of clusters and groups within the same high-dimensional dataset with one 3-dimensional embedding, as opposed to providing different embeddings of the same data and trying to match the corresponding points. Second, to illustrate the effects of different hyper-parameters of the classical t-SNE. Third, by considering multiple different notions of clustering in data, ENS-t-SNE can generate an alternative embedding than the classic t-SNE. We provide an extensive quantitative evaluation with real-world and synthetic datasets of different sizes and using different numbers of projections.

READ FULL TEXT
research
09/13/2019

Multi-Perspective, Simultaneous Embedding

We describe a method for simultaneous visualization of multiple pairwise...
research
04/03/2023

Synthesis parameter effect detection using quantitative representations and high dimensional distribution distances

Detection of effects of the parameters of the synthetic process on the m...
research
09/22/2021

Index t-SNE: Tracking Dynamics of High-Dimensional Datasets with Coherent Embeddings

t-SNE is an embedding method that the data science community has widely ...
research
10/01/2020

Faster Binary Embeddings for Preserving Euclidean Distances

We propose a fast, distance-preserving, binary embedding algorithm to tr...
research
10/06/2021

Clustering Plotted Data by Image Segmentation

Clustering algorithms are one of the main analytical methods to detect p...
research
06/29/2016

A Semi-Definite Programming approach to low dimensional embedding for unsupervised clustering

This paper proposes a variant of the method of Guédon and Verhynin for e...
research
03/09/2020

Approximate is Good Enough: Probabilistic Variants of Dimensional and Margin Complexity

We present and study approximate notions of dimensional and margin compl...

Please sign up or login with your details

Forgot password? Click here to reset