LANTERN in the Event Stream: Training-Free Temporal Knowledge Graph Forecasting by Balancing Inertia and Shifts
Chengyuan Jin, Ao Chang, Daojian Zeng, Wenhao Teng, Xiangwen Liao, Kang Liu, Jun Zhao, Yubo Chen
Shandong Institute of Automation Beijing Academy of Artificial Intelligence Institute of Automation Hunan Normal University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Temporal knowledge graph forecasting (TKGF) asks a model to rank the most plausible future entity for a query such as (s, r, ?, t) from historical events.Recent training-free methods use large language models (LLMs) for this task, but their accuracy depends heavily on which past events are shown in the prompt under a tight context budget.We present LANTERN, a training-free prompting framework that addresses this bottleneck by combining two complementary views of history: a long-window strength score for stable interaction patterns and a short-window novelty score for sudden changes.LANTERN first filters unhelpful events, then selects a compact evidence set with Pareto-greedy selection, and finally adds one structure-aware analogical demonstration.Across ICEWS14, ICEWS05-15, ICEWS18, and GDELT, LANTERN consistently outperforms the state-of-the-art training-free baseline AnRe under the same backbone and 2-hop candidate protocol, improving Hits@1 by up to 2.5 points and MRR by up to 1.2 points.
逐年被引趋势
暂无年度引用数据
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIAdvanced Graph Neural Networks
Machine Learning in Healthcare · Time Series Analysis and Forecasting