arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.06240cs.LGstat.ML
收藏

使用动态时间弯曲比较时态图

Comparing Temporal Graphs Using Dynamic Time Warping

TU Berlin(柏林工业大学)

Vincent Froese, Brijnesh Jain, Rolf Niedermeier, Malte Renken

摘要:

在许多现实世界的网络中,节点对之间的链接会随着时间的推移而变化。因此,最近出现了一个研究时间图的热潮。识别时序图中的模式需要一个接近度来比较不同的时序图。为此,我们建议研究时间图上的动态时间弯曲。我们定义动态时间图弯曲距离(dtgw)来决定两个时间图的相异性。我们的新措施是灵活的,可以应用于各种应用领域。我们表明,计算dtgw距离是一个具有挑战性的(一般)NP-难优化问题,并确定一些多项式时间可解的特殊情况。此外,我们开发了一个二次规划公式和一个有效的启发式。在真实数据的实验中,我们表明,启发式执行非常好,我们的dtgw距离表现良好,在去匿名网络相比,其他方法。

英文摘要:

Within many real-world networks the links between pairs of nodes change over time. Thus, there has been a recent boom in studying temporal graphs. Recognizing patterns in temporal graphs requires a proximity measure to compare different temporal graphs. To this end, we propose to study dynamic time warping on temporal graphs. We define the dynamic temporal graph warping distance (dtgw) to determine the dissimilarity of two temporal graphs. Our novel measure is flexible and can be applied in various application domains. We show that computing the dtgw-distance is a challenging (in general) NP-hard optimization problem and identify some polynomial-time solvable special cases. Moreover, we develop a quadratic programming formulation and an efficient heuristic. In experiments on real-word data we show that the heuristic performs very well and that our dtgw-distance performs favorably in de-anonymizing networks compared to other approaches.

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

↑