Skip to content
Conference Open access

H²SCAN: Adaptive Time Series Representation Learning via Heterogeneous Hypergraph Structure-aware Contrasts

Sep 2026 · Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence · pp. 2465-2473 · 0 citations · 38 references

TL;DR

H²SCAN is proposed, a novel augmentation-free framework that derives contrastive supervision directly from graph topology and outperforms existing methods by modeling high-order multi-domain dependencies and preserving the semantic integrity of time series data.

Abstract

Learning universal representations for time series is fundamental for diverse downstream tasks. However, current approaches largely rely on handcrafted data augmentations, which may distort intrinsic temporal dynamics and structural regularities. In addition, most static representation learning frameworks struggle to cope with the non-stationary nature of real-world time series. To address these issues, we propose Heterogeneous Hypergraph Structure-aware Contrastive Adaptive Network (H²SCAN), a novel augmentation-free framework that derives contrastive supervision directly from graph topology. Specifically, H²SCAN constructs a heterogeneous hypergraph with three node types to capture multi-scale temporal characteristics. Building upon this representation, a meta-adaptation network is introduced to dynamically reweight heterogeneous hyperedges, enabling the model to adapt to distribution shifts in real-time. Finally, a structure-aware contrastive learning objective is employed to align latent representation similarity with the intrinsic hypergraph topology. Experiments on multiple benchmarks and cloud Kafka cluster datasets demonstrate that H²SCAN outperforms existing methods by modeling high-order multi-domain dependencies and preserving the semantic integrity of time series data.

Read PDF

Similar papers

Sep 2026

Spectral-temporal dual view graph convolutional networks: A deep learning framework for dynamic bipartite graphs.

Dynamic bipartite graphs (DBGs) are widely used in real-world scenarios, where representation learning is particularly challenging due to the heterogeneity of node types and the temporal evolution of interactions. A key difficulty lies in jointly capturing non-stationary micro-level preference dynamics and macro-level...

Zhe-Zhe Xing, Yu-Xin Ye, Zi-Heng Li et al. · 0 citations
Conference Open access Sep 2026

Dynamic Heterogeneous Graph Representation Learning: A Survey

This survey presents the first systematic review of DHG representation learning methods and proposes a novel algorithm-centric taxonomy that categorizes existing literature, including early embedding-based approaches, graph neural network (GNN)-based models, and relatively recent Transformer-based DHG methods, while ex...

Huan Liu, Peng-Fei Jiao, Jie Yin et al. · 0 citations
2026

Node-Wise Adaptive Scale Fusion: A Dual-View Framework for Spatio-Temporal Graphs

Multi-scale graph neural networks have shown strong performance in multivariate time-series forecasting by integrating representations at different temporal resolutions. However, existing fusion mechanisms typically assign the same scale weights to all nodes, implicitly assuming spatially homogeneous temporal preferenc...

Wei Chen, Wen-Yuan Wang, Wen-Xu Yan · 0 citations
Conference Open access Sep 2026

Frequency-Aware Augmentation and Alignment for Time Series Contrastive Learning

Contrastive learning has become a dominant paradigm for learning time series representations from large-scale unlabeled data. However, current methods are often adapted from computer vision and rely on random time-domain augmentations (e.g., jittering and cropping). Such augmentations can unpredictably disrupt the natu...

Yu-Sen Liu, Zhichen Lai, Hua Lu et al. · 0 citations
Book Open access Aug 2026

Invariant Structure Learning with Pre-trained Language Models for Spatio-temporal Graph

InvSTG-PLM, an invariance-aware spatiotemporal graph learning framework that grounds PLMs in invariant structures, is proposed and a deterministic robustness bound is justified, showing that mean–variance control upper bounds worst-case risk over simulated environments.

Ting Wang, Duo Zhou, Daqian Shi et al. · 0 citations
Conference Open access Sep 2026

ConDyGNet: Constraint-Guided Dynamic Graph Networks for Multivariate Time Series Forecasting

A Constraint-Guided Dynamic Graph Network (ConDyGNet), whose core idea is “global basis, dynamic weights”, which learns a low-rank global basis as a shared structural constraint and generates patch-wise basis mixing weights to construct dynamic propagation graphs.

Zhen-Zhou Li, Xiang Li, Zhibin Niu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.