arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2406.04897cs.LG
收藏

从链接预测到预测:解决基于批次的时序图学习中的挑战

From Link Prediction to Forecasting: Addressing Challenges in Batch-based Temporal Graph Learning

Center for Artificial Intelligence and Data Science (CAIDAS)(人工智能与数据科学中心(CAIDAS));Julius-Maximilians-Universität Würzburg(维尔茨堡大学)

Moritz Lampert, Christopher Blöcker, Ingo Scholtes

AI总结:

本文提出将动态链接预测转化为链接预测任务,以解决基于批次的时序图学习中的信息丢失和不一致问题。

摘要:

动态链接预测是许多近期工作中考虑的重要问题,这些工作提出了学习时序边模式的方法。为了评估其有效性,模型通常在连续时间和离散时间时序图数据集上进行评估,通常使用传统的批量导向评估设置。然而,正如我们在本文中所展示的,批量导向的评估往往不合适,并可能导致几个问题。无论边的出现时间如何,将边分成固定大小的批次会导致信息丢失或泄漏,这取决于数据的时间粒度。此外,固定大小的批次会创建持续时间不同的时间窗口,导致动态链接预测任务不一致。在本文中,我们实证地展示了传统批量评估如何导致模型性能失真,并阻碍方法之间的公平比较。我们通过将动态链接预测重新表述为链接预测任务来缓解这个问题,该任务更好地考虑了数据中存在的时序信息。

英文摘要:

Dynamic link prediction is an important problem considered in many recent works that propose approaches for learning temporal edge patterns. To assess their efficacy, models are evaluated on continuous-time and discrete-time temporal graph datasets, typically using a traditional batch-oriented evaluation setup. However, as we show in this work, a batch-oriented evaluation is often unsuitable and can cause several issues. Grouping edges into fixed-sized batches regardless of their occurrence time leads to information loss or leakage, depending on the temporal granularity of the data. Furthermore, fixed-size batches create time windows with different durations, resulting in an inconsistent dynamic link prediction task. In this work, we empirically show how traditional batch-based evaluation leads to skewed model performance and hinders the fair comparison of methods. We mitigate this problem by reformulating dynamic link prediction as a link forecasting task that better accounts for temporal information present in the data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑