An Effective Graph Learning based Approach for Temporal Link Prediction: The First Place of WSDM Cup 2022
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TrustGLM: Evaluating the Robustness of GraphLLMs Against Prompt, Text, and Structure Attacks
Social Biases in Knowledge Representations of Wikidata separates Global North from Global South
EC-LDA : Label Distribution Inference Attack against Federated Graph Learning with Embedding Compression
Higher-order Structure Boosts Link Prediction on Temporal Graphs
Unify Graph Learning with Text: Unleashing LLM Potentials for Session Search
Multi-Attribute Graph Estimation with Sparse-Group Non-Convex Penalties
토론
이 논문과 연결된 포럼 글이 아직 없습니다.