{"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/ftm-a-frame-level-timeline-modeling-method","title":"FTM: A Frame-level Timeline Modeling Method for Temporal Graph Representation Learning","arxiv_id":"2302.11814","date":"2023-02-23","proceeding":null,"authors":["Bowen Cao","Qichen Ye","Weiyuan Xu","Yuexian Zou"],"abstract":"Learning representations for graph-structured data is essential for graph analytical tasks. While remarkable progress has been made on static graphs, researches on temporal graphs are still in its beginning stage. The bottleneck of the temporal graph representation learning approach is the neighborhood aggregation strategy, based on which graph attributes share and gather information explicitly. Existing neighborhood aggregation strategies fail to capture either the short-term features or the long-term features of temporal graph attributes, leading to unsatisfactory model performance and even poor robustness and domain generality of the representation learning method. To address this problem, we propose a Frame-level Timeline Modeling (FTM) method that helps to capture both short-term and long-term features and thus learns more informative representations on temporal graphs. In particular, we present a novel link-based framing technique to preserve the short-term features and then incorporate a timeline aggregator module to capture the intrinsic dynamics of graph evolution as long-term features. Our method can be easily assembled with most temporal GNNs. Extensive experiments on common datasets show that our method brings great improvements to the capability, robustness, and domain generality of backbone methods in downstream tasks. Our code can be found at https://github.com/yeeeqichen/FTM.","url_abs":"https://arxiv.org/abs/2302.11814v2","url_pdf":"https://arxiv.org/pdf/2302.11814v2.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":"ftm-a-frame-level-timeline-modeling-method","repo_url":"https://github.com/yeeeqichen/ftm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"graph-representation-learning","task_name":"Graph Representation Learning"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[{"method_slug":"fail","method_name":"fail"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2302.11814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.11814"}},"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":"deterministic:regex_extraction","url":"https://github.com/yeeeqichen/FTM","reach":null}],"summary":{"ran":4},"by_repo_kind":{"official":{"samples":4,"ran":4,"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":4,"samples":[{"code_sha256_prefix":"6d7e3caf7d40c464","entry":"MergeLayer","repo":"yeeeqichen/FTM","repo_kind":"official","path":"modules/timeline.py","file_url":"https://github.com/yeeeqichen/FTM/blob/HEAD/modules/timeline.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"6d7e3caf7d40c464"}},{"code_sha256_prefix":"550ffe32f6af1edb","entry":"MultiHeadAttention","repo":"yeeeqichen/FTM","repo_kind":"official","path":"modules/timeline.py","file_url":"https://github.com/yeeeqichen/FTM/blob/HEAD/modules/timeline.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"550ffe32f6af1edb"}},{"code_sha256_prefix":"2aa482646b694cef","entry":"ScaledDotProductAttention","repo":"yeeeqichen/FTM","repo_kind":"official","path":"modules/timeline.py","file_url":"https://github.com/yeeeqichen/FTM/blob/HEAD/modules/timeline.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"2aa482646b694cef"}},{"code_sha256_prefix":"a4b2562b079bd239","entry":"TimeAggModel","repo":"yeeeqichen/FTM","repo_kind":"official","path":"modules/timeline.py","file_url":"https://github.com/yeeeqichen/FTM/blob/HEAD/modules/timeline.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a4b2562b079bd239"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}