In Search Of The Most Efficient And Memory-saving Visualization Of High Dimensional Data

Abstract

Interactive exploration of large, multidimensional datasets plays a very important role in various scientific fields. It makes it possible not only to identify important structural features and forms, such as clusters of vertices and their connection patterns, but also to evaluate their interrelationships in terms of position, distance, shape and connection density. We argue that the visualization of multidimensional data is well approximated by the problem of two-dimensional embedding of undirected nearest-neighbor graphs. The size of complex networks is a major challenge for today's computer systems and still requires more efficient data embedding algorithms. Existing reduction methods are too slow and do not allow interactive manipulation. We show that high-quality embeddings are produced with minimal time and memory complexity. We present very efficient IVHD algorithms (CPU and GPU) and compare them with the latest and most popular dimensionality reduction methods. We show that the

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyminch2023in

Related papers

• 2-D Embedding Of Large And High-dimensional Data With Minimal Memory And Computational Time Requirements (2019)0.00
• Visualizing Large-scale And High-dimensional Data (2016)18.48
• Interactive Dimensionality Reduction Using Similarity Projections (2018)8.09
• Hd-index: Pushing The Scalability-accuracy Boundary For Approximate Knn Search In High-dimensional Spaces (2018)14.02
• Learning To Compress And Search Visual Data In Large-scale Systems (2019)0.00
• Gleanvec: Accelerating Vector Search With Minimalist Nonlinear Dimensionality Reduction (2024)0.00
• Massively Parallel Graph Drawing And Representation Learning (2020)4.52
• Dimensionality Reduced Clustered Data And Order Partition And Stepwise Dimensionality Increasing Indices (2024)0.00