Journal article · 2021 · Open access
Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs
Visual Informatics, 5(2), 51–59 · Published 1 June 2021 · DOI 10.1016/j.visinf.2021.06.002
In brief
“Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs” is a 2021 journal article by Haiyang Zhu and 7 co-authors, published in Visual Informatics. OpenAlex counts 24 citations as of 16 November 2026, which puts it in the top 5% of works published in 2021 by citations. It is open access under a CC BY-NC-ND licence: the full text is free to read at Visual Informatics.
- Citations
- 24
- Most cited in
- 2023 (7)
- Field-weighted impact
- 3.26
- References
- 45
- Authors
- 8
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. Experiments on various large-scale datasets indicate that our approach achieves a speedup by a factor of five for KNN graph visualization compared to LargeVis and yields aesthetically pleasing visualization results.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Zhu, H., Zhu, M., Feng, Y., Cai, D., Hu, Y., Wu, S., Wu, X., & Chen, W. (2021). Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs. Visual Informatics, 5(2), 51–59. https://doi.org/10.1016/j.visinf.2021.06.002
MLA 9
Zhu, Haiyang, et al. “Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs.” Visual Informatics, vol. 5, no. 2, 2021, pp. 51–59. https://doi.org/10.1016/j.visinf.2021.06.002.
Chicago
Zhu, Haiyang, Minfeng Zhu, Yingchaojie Feng, Deng Cai, Yuanzhe Hu, Shilong Wu, Xiangyang Wu, and Wei Chen. 2021. “Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs.” Visual Informatics 5 (2): 51–59. https://doi.org/10.1016/j.visinf.2021.06.002.
Harvard
Zhu, H. et al. (2021) ‘Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs’, Visual Informatics, 5(2), pp. 51–59. doi:10.1016/j.visinf.2021.06.002.
IEEE
H. Zhu et al., “Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs,” Visual Informatics, vol. 5, no. 2, pp. 51–59, 2021, doi: 10.1016/j.visinf.2021.06.002.
BibTeX
@article{zhu2021visualizing,
title = {{Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs}},
author = {Zhu, Haiyang and Zhu, Minfeng and Feng, Yingchaojie and Cai, Deng and Hu, Yuanzhe and Wu, Shilong and Wu, Xiangyang and Chen, Wei},
journal = {Visual Informatics},
year = {2021},
volume = {5},
number = {2},
pages = {51--59},
doi = {10.1016/j.visinf.2021.06.002},
url = {https://doi.org/10.1016/j.visinf.2021.06.002}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2021 | 3 | |
| 2022 | 5 | |
| 2023 | 7 | |
| 2024 | 5 | |
| 2025 | 4 |
Its field-weighted citation impact is 3.26: it has been cited 3.26 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Data Visualization and Analytics
- high-dimensional data visualization
- k-nearest neighbor graph
- hierarchical embedding
- graph layout
- large-scale data
- multi-level representation
- non-convex cost functions
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Zhu, H., Zhu, M., Feng, Y., Cai, D., Hu, Y., Wu, S., Wu, X., & Chen, W. (2021). Visualizing large-scale high-dimensional data via hierarchical embedding of KNN graphs. Visual Informatics, 5(2), 51–59. https://doi.org/10.1016/j.visinf.2021.06.002
How many times has this paper been cited?
24 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access: read the free full text at Visual Informatics.
Who wrote this paper?
Haiyang Zhu, Minfeng Zhu, Yingchaojie Feng, Deng Cai, Yuanzhe Hu, Shilong Wu, Xiangyang Wu, Wei Chen.
What is the DOI of this paper?
10.1016/j.visinf.2021.06.002. The permanent link is https://doi.org/10.1016/j.visinf.2021.06.002.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.