{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/towards-better-evaluation-for-dynamic-link","title":"Towards Better Evaluation for Dynamic Link Prediction","arxiv_id":"2207.10128","date":"2022-07-20","proceeding":null,"authors":["Farimah Poursafaei","Shenyang Huang","Kellin Pelrine","Reihaneh Rabbany"],"abstract":"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.","url_abs":"https://arxiv.org/abs/2207.10128v2","url_pdf":"https://arxiv.org/pdf/2207.10128v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"towards-better-evaluation-for-dynamic-link","repo_url":"https://github.com/fpour/dgb","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"dynamic-link-prediction","task_name":"Dynamic Link Prediction"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"memorization","task_name":"Memorization"},{"task_slug":"prediction","task_name":"Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2207.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.10128"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/fpour/dgb","reach":null}],"summary":{"ran_draft_wrong":2,"ran_fixture":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"0128192cd65f0a98","entry":"edge_bank_repetition_based_memory","repo":"fpour/dgb","repo_kind":"official","path":"EdgeBank/link_pred/edge_bank_baseline.py","file_url":"https://github.com/fpour/dgb/blob/HEAD/EdgeBank/link_pred/edge_bank_baseline.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"0128192cd65f0a98"}},{"code_sha256_prefix":"6b123fcead1bed9e","entry":"edge_bank_unlimited_memory","repo":"fpour/dgb","repo_kind":"official","path":"EdgeBank/link_pred/edge_bank_baseline.py","file_url":"https://github.com/fpour/dgb/blob/HEAD/EdgeBank/link_pred/edge_bank_baseline.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6b123fcead1bed9e"}},{"code_sha256_prefix":"866520104ae86d72","entry":"predict_links","repo":"fpour/dgb","repo_kind":"official","path":"EdgeBank/link_pred/edge_bank_baseline.py","file_url":"https://github.com/fpour/dgb/blob/HEAD/EdgeBank/link_pred/edge_bank_baseline.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"866520104ae86d72"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}