2022/07/20 by Farimah Poursafaei, Poursafaei, Farimah, Shenyang Huang +5 · 13 citations
Computer Science · Decision Sciences · Physics and Astronomy · #Advanced Graph Neural Networks #Complex Network Analysis Techniques #Data Quality and Management #FOS: Computer and information sciences #Machine Learning (cs.LG) #Social and Information Networks (cs.SI)
paper · pdf · doi:10.48550/arxiv.2207.10128
openalex publication_date 2022/07/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Despite the prevalence of recent success in learning from static graphs, learning from time-evolving graphs remains an open challenge. In this work, we design new, more stringent evaluation procedures for link prediction specific to dynamic graphs, which reflect real-world considerations, to better compare the strengths and weaknesses of methods. First, we create two visualization techniques to understand the reoccurring patterns of edges over time and show that many edges reoccur at later time steps. Based on this observation, we propose a pure memorization baseline called EdgeBank. EdgeBank achieves surprisingly strong performance across multiple settings because easy negative edges are often used in the current evaluation setting. To evaluate against more difficult negative edges, we introduce two more challenging negative sampling strategies that improve robustness and better match real-world applications. Lastly, we introduce six new dynamic graph datasets from a diverse set of domains missing from current benchmarks, providing new challenges and opportunities for future research. Our code repository is accessible at https://github.com/fpour/DGB.git.