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 gra

Stats

• citations290
• S2 citations—
• github stars0
• HF likes0
• heat score18.48
• arxiv keytang2016visualizing

Related papers

• In Search Of The Most Efficient And Memory-saving Visualization Of High Dimensional Data (2023)0.00
• 2-D Embedding Of Large And High-dimensional Data With Minimal Memory And Computational Time Requirements (2019)0.00
• Learning To Compress And Search Visual Data In Large-scale Systems (2019)0.00
• Hd-index: Pushing The Scalability-accuracy Boundary For Approximate Knn Search In High-dimensional Spaces (2018)14.02
• Revisiting \(k\)-nearest Neighbor Graph Construction On High-dimensional Data : Experiments And Analyses (2021)0.00
• Interactive Dimensionality Reduction Using Similarity Projections (2018)8.09
• Navigable Graphs For High-dimensional Nearest Neighbor Search: Constructions And Limits (2024)4.52
• Stars: Tera-scale Graph Building For Clustering And Graph Learning (2022)0.00