{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/spatial-temporal-fusion-graph-neural-networks","title":"Spatial-Temporal Fusion Graph Neural Networks for Traffic Flow Forecasting","arxiv_id":"2012.09641","date":"2020-12-15","proceeding":null,"authors":["Mengzhang Li","Zhanxing Zhu"],"abstract":"Spatial-temporal data forecasting of traffic flow is a challenging task because of complicated spatial dependencies and dynamical trends of temporal pattern between different roads. Existing frameworks typically utilize given spatial adjacency graph and sophisticated mechanisms for modeling spatial and temporal correlations. However, limited representations of given spatial graph structure with incomplete adjacent connections may restrict effective spatial-temporal dependencies learning of those models. To overcome those limitations, our paper proposes Spatial-Temporal Fusion Graph Neural Networks (STFGNN) for traffic flow forecasting. SFTGNN could effectively learn hidden spatial-temporal dependencies by a novel fusion operation of various spatial and temporal graphs, which is generated by a data-driven method. Meanwhile, by integrating this fusion graph module and a novel gated convolution module into a unified layer, SFTGNN could handle long sequences. Experimental results on several public traffic datasets demonstrate that our method achieves state-of-the-art performance consistently than other baselines.","url_abs":"https://arxiv.org/abs/2012.09641v2","url_pdf":"https://arxiv.org/pdf/2012.09641v2.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":"spatial-temporal-fusion-graph-neural-networks","repo_url":"https://github.com/MengzhangLI/STFGNN","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"mxnet","reach":{"status":"unanswered"}},{"paper_slug":"spatial-temporal-fusion-graph-neural-networks","repo_url":"https://github.com/lwm412/STFGNN-Pytorch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"}],"methods":[{"method_slug":"1x1-convolution","method_name":"1x1 Convolution"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"gated-convolution","method_name":"Gated Convolution"},{"method_slug":"glu","method_name":"Gated Linear Unit"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/traffic-prediction-on-bjtaxi","task":"Traffic Prediction","dataset":"BJTaxi","model":"STFGNN","rank_in_archive_order":4,"of":5,"metrics":{"MAE @ in":"13.83","MAE @ out":"13.89","MAPE (%) @ in":"19.29","MAPE (%) @ out":"19.41"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-nycbike1","task":"Traffic Prediction","dataset":"NYCBike1","model":"STFGNN","rank_in_archive_order":4,"of":4,"metrics":{"MAE @ in":"6.53","MAE @ out":"6.79","MAPE (%) @ in":"32.14","MAPE (%) @ out":"32.88"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-nycbike2","task":"Traffic Prediction","dataset":"NYCBike2","model":"STFGNN","rank_in_archive_order":4,"of":4,"metrics":{"MAE @ in":"5.80","MAE @ out":"5.51","MAPE (%) @ in":"30.73","MAPE (%) @ out":"29.98"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-nyctaxi","task":"Traffic Prediction","dataset":"NYCTaxi","model":"STFGNN","rank_in_archive_order":4,"of":5,"metrics":{"MAE @ in":"16.25","MAE @ out":"12.47","MAPE (%) @ in":"24.01","MAPE (%) @ out":"23.28"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pems07","task":"Traffic Prediction","dataset":"PeMS07","model":"STFGNN","rank_in_archive_order":13,"of":17,"metrics":{"MAE@1h":"22.07"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2012.09641","atlas_url":"https://app.syntology.ai/?focus=2012.09641","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2012.09641"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2012.09641\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2012.09641"},"call":"get_concepts_for_paper(arxiv_id=\"2012.09641\")"}],"by_repo":[{"repo":"MengzhangLI/STFGNN","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lwm412/STFGNN-Pytorch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b35161c25e4a9617340719bea1b1535632a230136fe3ff1b7a9f06301d4ba9cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}