跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.20521 · v1

LINK: Lightweight and Inductive Node-to-Node Propagation Rule Learning for Traffic Kriging

首次提交 2026-11-16 12:48
版本更新 2026-11-16 12:48
雷达观测 2026-11-17 13:07
arXiv ↗PDF ↗

摘要

Spatio-temporal traffic kriging aims to reconstruct traffic time series at unobserved locations with no historical traffic observations by leveraging spatial and temporal dependencies across the road network. Existing Graph Neural Network (GNN)-based approaches primarily rely on neighborhood aggregation to capture spatial dependencies, thereby modeling traffic interactions implicitly and making it difficult to accurately recover traffic magnitudes at locations without historical observations. To address this limitation, we propose LINK, a Lightweight and Inductive Node-to-node propagation rule learning paradigm for traffic Kriging. LINK introduces three key designs: 1) a propagation-centric traffic kriging paradigm that explicitly learns a shared node-to-node transition rule; 2) a context-aware Spectral Propagation Network that performs traffic-state propagation in both the spectral and time domains; and 3) TraffiKrig, a realistic traffic kriging benchmark that preserves heterogeneous road-segment characteristics and road-specific metadata while enabling systematic comparison of representative kriging methods under a unified metadata-enhanced setting. Extensive experiments demonstrate that LINK achieves strong reconstruction accuracy and computational efficiency. Compared with the strongest baseline on each subset, LINK achieves an average MAE reduction of 54.7% over original baselines. LINK also achieves substantial efficiency improvements, reducing training time by 66.5% and inference time by 86.6% compared with the fastest competing methods. Zero-shot experiments further demonstrate the transferability of the learned propagation rule across regions.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-16 12:48 · 最新观测版本

LINK: Lightweight and Inductive Node-to-Node Propagation Rule Learning for Traffic Kriging

Spatio-temporal traffic kriging aims to reconstruct traffic time series at unobserved locations with no historical traffic observations by leveraging spatial and temporal dependencies across the road network. Existing Graph Neural Network (GNN)-based approaches primarily rely on neighborhood aggregation to capture spatial dependencies, thereby modeling traffic interactions implicitly and making it difficult to accurately recover traffic magnitudes at locations without historical observations. To address this limitation, we propose LINK, a Lightweight and Inductive Node-to-node propagation rule learning paradigm for traffic Kriging. LINK introduces three key designs: 1) a propagation-centric traffic kriging paradigm that explicitly learns a shared node-to-node transition rule; 2) a context-aware Spectral Propagation Network that performs traffic-state propagation in both the spectral and time domains; and 3) TraffiKrig, a realistic traffic kriging benchmark that preserves heterogeneous road-segment characteristics and road-specific metadata while enabling systematic comparison of representative kriging methods under a unified metadata-enhanced setting. Extensive experiments demonstrate that LINK achieves strong reconstruction accuracy and computational efficiency. Compared with the strongest baseline on each subset, LINK achieves an average MAE reduction of 54.7% over original baselines. LINK also achieves substantial efficiency improvements, reducing training time by 66.5% and inference time by 86.6% compared with the fastest competing methods. Zero-shot experiments further demonstrate the transferability of the learned propagation rule across regions.

查看此版本解读 →查看此版本原文 ↗