Pith. sign in

REVIEW

An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.01820 v1 pith:5YNNPDNP submitted 2022-03-01 cs.SI cs.AIcs.IRcs.LG

classification cs.SIcs.AIcs.IRcs.LG
keywords temporalgraphcompetitiondatasetfirstinformationlinkperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Sign in to comment.

Pith tools