Conference abstract · 2023
Conference abstractPublished 2017
A novel linear-time and memory saving approach for visual exploratory data analysis: Data embedding and graph visualization
AGH University of Science and Technology, Poland
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Data embedding (DE) and graph visualization (GV) methods are very congruent tools used in exploratory data analysis for visualization of complex data such as high-dimensional data and complex networks, respectively. However, high computational complexity and memory loads of existing DE and GV algorithms (based on t-SNE concept from one hand, and force-directed methods from the other), considerably hinders visualization of truly large and big data consisting of as many as M~106+ data objects and N~103+ dimensions. In this paper, we demonstrate the high computational efficiency and robustness of our approach to data embedding and interactive data visualization. We show that by employing only a small fraction of distances between data objects, one can obtain very satisfactory reconstruction of the topology of N-D data in 2D in a linear-time O (M). The IVHD (Interactive Visualization of High-Dimensional Data) method quickly and properly reconstructs the N-D data topology in a fraction of computational time required for the state-of-art DE methods such as bh-SNE and all its clones. Our method can be used for both metric and non-metric (e.g. large graphs) data visualization. Moreover, we demonstrate that even poor approximations of the nearest neighbor (NN) graph, representing high-dimensional data, can yield acceptable data embedding. Furthermore, some incorrectness in the nearest neighbor list can often be useful to improve the quality of data visualization. This robustness of IVHD, together with its high memory and time efficiencies, meets perfectly the requirements of big and distributed data visualization, when finding the accurate nearest neighbor list represents a great computational challenge.
Subjects
Computer Science & ITEngineeringAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Nov 2014
Visual Exploration of Amnesic Time Series Data Streams
Conference abstract · 7 Sep 2017
Data enabled approaches to sensitivity analysis, calibration and risk visualization in general circulation models
Research article · 15 Jun 2016
A Secure Approach for Data Hiding using Visual Cryptography
Research article · Mar 2014
Proposing a Novel Synergized K-Degree L-Diversity TCloseness Model for Graph Based Data Anonymization
More from this journal
The newest in Journal of Computer Engineering & Information Technology.
Review article · 27 Oct 2025
Dukan Daari Inventory Management System
Research article · 17 Jun 2025
Leveraging Information Flow Tracking for Enhanced Security in Cloud Computing
Editorial · 31 Mar 2025
Low-Code/No-Code Platforms: Democratizing Software Development
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Computer Engineering & Information Technology
- SubjectComputer Science & IT
- SubjectEngineering
- BylineArticles whose byline prints “Witold Dzwinel”

