A Grid-based Method for Removing Overlaps of Dimensionality Reduction Scatterplot Layouts

• URL: http://arxiv.org/abs/1903.06262v8
• Date: Tue, 10 Oct 2023 23:31:32 GMT
• Title: A Grid-based Method for Removing Overlaps of Dimensionality Reduction Scatterplot Layouts
• Authors: Gladys M. Hilasaca, Wilson E. Marc\'ilio-Jr, Danilo M. Eler, Rafael M. Martins, and Fernando V. Paulovich
• Abstract summary: Distance Grid (DGrid) is a novel post-processing strategy to remove overlaps from Dimensionality Reduction (DR) scatterplot layouts. It faithfully preserves the original layout's characteristics and bounds the minimum glyph sizes.
• Score: 40.11095094521714
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Dimensionality Reduction (DR) scatterplot layouts have become a ubiquitous visualization tool for analyzing multidimensional datasets. Despite their popularity, such scatterplots suffer from occlusion, especially when informative glyphs are used to represent data instances, potentially obfuscating critical information for the analysis under execution. Different strategies have been devised to address this issue, either producing overlap-free layouts that lack the powerful capabilities of contemporary DR techniques in uncovering interesting data patterns or eliminating overlaps as a post-processing strategy. Despite the good results of post-processing techniques, most of the best methods typically expand or distort the scatterplot area, thus reducing glyphs' size (sometimes) to unreadable dimensions, defeating the purpose of removing overlaps. This paper presents Distance Grid (DGrid), a novel post-processing strategy to remove overlaps from DR layouts that faithfully preserves the original layout's characteristics and bounds the minimum glyph sizes. We show that DGrid surpasses the state-of-the-art in overlap removal (through an extensive comparative evaluation considering multiple different metrics) while also being one of the fastest techniques, especially for large datasets. A user study with 51 participants also shows that DGrid is consistently ranked among the top techniques for preserving the original scatterplots' visual characteristics and the aesthetics of the final results.

Related papers

• Distributional Reduction: Unifying Dimensionality Reduction and Clustering with Gromov-Wasserstein [56.62376364594194]
  Unsupervised learning aims to capture the underlying structure of potentially large and high-dimensional datasets. In this work, we revisit these approaches under the lens of optimal transport and exhibit relationships with the Gromov-Wasserstein problem. This unveils a new general framework, called distributional reduction, that recovers DR and clustering as special cases and allows addressing them jointly within a single optimization problem.
  arXiv  Detail & Related papers  (2024-02-03T19:00:19Z)
• Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
  This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data. The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
  arXiv  Detail & Related papers  (2024-01-12T17:57:07Z)
• ShaRP: Shape-Regularized Multidimensional Projections [71.30697308446064]
  We present a novel projection technique - ShaRP - that provides users explicit control over the visual signature of the created scatterplot. ShaRP scales well with dimensionality and dataset size, and generically handles any quantitative dataset.
  arXiv  Detail & Related papers  (2023-06-01T11:16:58Z)
• A Brief Survey on Representation Learning based Graph Dimensionality Reduction Techniques [0.0]
  Dimensionality reduction techniques map data represented on higher dimensions onto lower dimensions with varying degrees of information loss. There exist several techniques that are efficient at generating embeddings from graph data and projecting them onto low dimensional latent spaces. We present this survey to outline the benefits as well as problems associated with the existing graph dimensionality reduction techniques.
  arXiv  Detail & Related papers  (2022-10-13T04:29:24Z)
• FORBID: Fast Overlap Removal By stochastic gradIent Descent for Graph Drawing [1.1470070927586014]
  Overlaps between nodes can hinder graph visualization readability. Overlap Removal (OR) algorithms have been proposed as layout post-processing. We propose a novel gradient models OR as a joint stress and scaling optimization problem.
  arXiv  Detail & Related papers  (2022-08-19T13:51:44Z)
• Visual Cluster Separation Using High-Dimensional Sharpened Dimensionality Reduction [65.80631307271705]
  High-Dimensional Sharpened DR' (HD-SDR) is tested on both synthetic and real-world data sets. Our method achieves good quality (measured by quality metrics) and scales computationally well with large high-dimensional data. To illustrate its concrete applications, we further apply HD-SDR on a recent astronomical catalog.
  arXiv  Detail & Related papers  (2021-10-01T11:13:51Z)
• Multi-point dimensionality reduction to improve projection layout reliability [77.34726150561087]
  In ordinary Dimensionality Reduction (DR), each data instance in an m-dimensional space (original space) is mapped to one point in a d-dimensional space (visual space) Our solution, named Red Gray Plus, is built upon and extends a combination of ordinary DR and graph drawing techniques.
  arXiv  Detail & Related papers  (2021-01-15T17:17:02Z)
• Supervised Visualization for Data Exploration [9.742277703732187]
  We describe a novel supervised visualization technique based on random forest proximities and diffusion-based dimensionality reduction. Our approach is robust to noise and parameter tuning, thus making it simple to use while producing reliable visualizations for data exploration.
  arXiv  Detail & Related papers  (2020-06-15T19:10:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.