Visualizing Large-scale and High-dimensional Data

Abstract

We study the problem of visualizing large-scale and high-dimensional data in a low-dimensional (typically 2D or 3D) space. Much success has been reported recently by techniques that first compute a similarity structure of the data points and then project them into a low-dimensional space with the structure preserved. These two steps suffer from considerable computational costs, preventing the state-of-the-art methods such as the t-SNE from scaling to large-scale and high-dimensional data (e.g., millions of data points and hundreds of dimensions). We propose the LargeVis, a technique that first constructs an accurately approximated K-nearest neighbor graph from the data and then layouts the graph in the low-dimensional space. Comparing to t-SNE, LargeVis significantly reduces the computational cost of the graph construction step and employs a principled probabilistic model for the visualization step, the objective of which can be effectively optimized through asynchronous stochastic gradient descent with a linear time complexity. The whole procedure thus easily scales to millions of high-dimensional data points. Experimental results on real-world data sets demonstrate that the LargeVis outperforms the state-of-the-art methods in both efficiency and effectiveness. The hyper-parameters of LargeVis are also much more stable over different data sets.

WWW 2016

References in corpus (1)

• LINE: Large-scale Information Network Embedding

Cited by in corpus (18)

• Accelerated Hierarchical Density Clustering
• GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding
• Supporting Analysis of Dimensionality Reduction Results with Contrastive Learning
• Manifold Learning of Four-dimensional Scanning Transmission Electron Microscopy
• Network Embedding with Completely-imbalanced Labels
• Measuring and Explaining the Inter-Cluster Reliability of Multidimensional Projections
• Uniform Manifold Approximation with Two-phase Optimization
• Heavy-tailed kernels reveal a finer cluster structure in t-SNE visualisations
• Force-Directed Graph Layouts Revisited: A New Force Based on the T-Distribution
• Deep Co-Space: Sample Mining Across Feature Transformation for Semi-Supervised Learning
• IAN: Iterated Adaptive Neighborhoods for manifold learning and dimensionality estimation
• Collection Space Navigator: An Interactive Visualization Interface for Multidimensional Datasets
• Cluster Analysis of a Symbolic Regression Search Space
• Incorporating Texture Information into Dimensionality Reduction for High-Dimensional Images
• An Entropy Based Outlier Score and its Application to Novelty Detection for Road Infrastructure Images
• Fuzzy simplicial sets and their application to geometric data analysis
• MoE-Enhanced Explainable Deep Manifold Transformation for Complex Data Embedding and Visualization
• mQAPViz: A divide-and-conquer multi-objective optimization algorithm to compute large data visualizations