一种基于图学习的有效时间链接预测方法--2022年WSDM杯第一名
An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022
摘要:
时态链接预测作为时态图中最关键的工作之一,受到了研究者的广泛关注。WSDM Cup 2022寻求预测时间图上时间跨度内边缘存在概率的解决方案。本文介绍了AntGraph的解决方案,它在比赛中获得了第一名。我们首先分析了去除时态信息后的性能理论上界,这意味着只有图上的结构和属性信息才能获得很好的性能。基于这一假设,然后我们介绍了几个精心设计的功能。最后,在竞争数据集上进行的实验显示了我们的建议的优越性,在数据集A上获得了0.666的AUC得分,在数据集B上获得了0.902的AUC得分,消融研究也证明了每个特征的效率。代码可在https://github.com/im0qianqian/WSDM2022TGP-AntGraph上公开获取。
英文摘要:
Temporal link prediction, as one of the most crucial work in temporal graphs, has attracted lots of attention from the research area. The WSDM Cup 2022 seeks for solutions that predict the existence probabilities of edges within time spans over temporal graph. This paper introduces the solution of AntGraph, which wins the 1st place in the competition. We first analysis the theoretical upper-bound of the performance by removing temporal information, which implies that only structure and attribute information on the graph could achieve great performance. Based on this hypothesis, then we introduce several well-designed features. Finally, experiments conducted on the competition datasets show the superiority of our proposal, which achieved AUC score of 0.666 on dataset A and 0.902 on dataset B, the ablation studies also prove the efficiency of each feature. Code is publicly available at https://github.com/im0qianqian/WSDM2022TGP-AntGraph.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。