Uncovering Temporal Patterns in Visualizations of High-Dimensional Data

Pavlin G. Poličar, Blaž Zupan
3/27/2024
cs.LGcs.HC

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

With the increasing availability of high-dimensional data, analysts often rely on exploratory data analysis to understand complex data sets. A key approach to exploring such data is dimensionality reduction, which embeds high-dimensional data in two dimensions to enable visual exploration. However, popular embedding techniques, such as t-SNE and UMAP, typically assume that data points are independent. When this assumption is violated, as in time-series data, the resulting visualizations may fail to reveal important temporal patterns and trends. To address this, we propose a formal extension to existing dimensionality reduction methods that incorporates two temporal loss terms that explicitly highlight temporal progression in the embedded visualizations. Through a series of experiments on both synthetic and real-world datasets, we demonstrate that our approach effectively uncovers temporal patterns and improves the interpretability of the visualizations. Furthermore, the method improves temporal coherence while preserving the fidelity of the embeddings, providing a robust tool for dynamic data analysis.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{poliar2024uncovering,
  title  = {Uncovering Temporal Patterns in Visualizations of High-Dimensional Data},
  author = {Pavlin G. Poličar and Blaž Zupan},
  year   = {2024},
  eprint = {2403.19040},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.19040v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.19040.svg)](https://codeofpaper.com/paper/2403.19040)

Discussion