Uncovering Temporal Patterns in Visualizations of High-Dimensional Data
Pavlin G. Poličar, Blaž Zupan
TL;DR
Temporal data visualization benefits from embeddings that reveal progression, which standard DR methods often miss. The authors extend t-SNE with two losses, Directional Coherence Loss ($L_{\text{DCL}}$) and Edge Length Loss ($L_{\text{ELL}}$), resulting in a combined objective $L = L_{\text{t-SNE}} + \lambda L_{\text{DCL}} + \mu L_{\text{ELL}}$ that emphasizes temporal trajectories while preserving data topology. Across synthetic and real-world datasets, the approach improves temporal coherence metrics and reveals cyclic and directional patterns, with guidelines for parameter settings to balance fidelity and readability. The work provides a practical, temporally-aware DR framework that can enhance interpretation and communication of dynamic data, along with quantitative evaluation methodologies anchored in both dimensionality reduction and graph-visualization literature.
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.
