#6282. Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs

September 2026publication date
Proposal available till 20-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Computer Graphics and Computer-Aided Design;
Software;
Human-Computer Interaction;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №6282.1 Contract №6282.2 Contract №6282.3 Contract №6282.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
Visualizing intrinsic structures of high-dimensional data is an essential task in data analysis. Over the past decades, a large number of methods have been proposed. Among all solutions, one promising way for enabling effective visual exploration is to construct a k-nearest neighbor (KNN) graph and visualize the graph in a low-dimensional space. Yet, state-of-the-art methods such as the LargeVis still suffer from two main problems when applied to large-scale data: (1) they may produce unappealing visualizations due to the non-convexity of the cost function; (2) visualizing the KNN graph is still time-consuming. In this work, we propose a novel visualization algorithm that leverages a multi-level representation to achieve a high-quality graph layout and employs a cluster-based approximation scheme to accelerate the KNN graph layout.
Keywords:
Graph visualization; High-dimensional data visualization; KNN graph

Contacts :
0