{"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/dynamic-graph-convolutional-recurrent-network","title":"Dynamic Graph Convolutional Recurrent Network for Traffic Prediction: Benchmark and Solution","arxiv_id":"2104.14917","date":"2021-04-30","proceeding":null,"authors":["Fuxian Li","Jie Feng","Huan Yan","Guangyin Jin","Depeng Jin","Yong Li"],"abstract":"Traffic prediction is the cornerstone of an intelligent transportation system. Accurate traffic forecasting is essential for the applications of smart cities, i.e., intelligent traffic management and urban planning. Although various methods are proposed for spatio-temporal modeling, they ignore the dynamic characteristics of correlations among locations on road networks. Meanwhile, most Recurrent Neural Network (RNN) based works are not efficient enough due to their recurrent operations. Additionally, there is a severe lack of fair comparison among different methods on the same datasets. To address the above challenges, in this paper, we propose a novel traffic prediction framework, named Dynamic Graph Convolutional Recurrent Network (DGCRN). In DGCRN, hyper-networks are designed to leverage and extract dynamic characteristics from node attributes, while the parameters of dynamic filters are generated at each time step. We filter the node embeddings and then use them to generate a dynamic graph, which is integrated with a pre-defined static graph. As far as we know, we are the first to employ a generation method to model fine topology of dynamic graph at each time step. Further, to enhance efficiency and performance, we employ a training strategy for DGCRN by restricting the iteration number of decoder during forward and backward propagation. Finally, a reproducible standardized benchmark and a brand new representative traffic dataset are opened for fair comparison and further research. Extensive experiments on three datasets demonstrate that our model outperforms 15 baselines consistently.","url_abs":"https://arxiv.org/abs/2104.14917v2","url_pdf":"https://arxiv.org/pdf/2104.14917v2.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":"dynamic-graph-convolutional-recurrent-network","repo_url":"https://github.com/tsinghua-fib-lab/Traffic-Benchmark","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"management","task_name":"Management"},{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/traffic-prediction-on-ne-bj","task":"Traffic Prediction","dataset":"NE-BJ","model":"DGCRN","rank_in_archive_order":2,"of":6,"metrics":{"12 steps MAE":"4.79"},"uses_additional_data":false}],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2104.14917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14917"}},"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/tsinghua-fib-lab/Traffic-Benchmark","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran_violates":1,"unverified":2},"by_repo_kind":{"official":{"samples":3,"ran":1,"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":"9a7928795f74526c","entry":"sym_adj","repo":"tsinghua-fib-lab/Traffic-Benchmark","repo_kind":"official","path":"methods/DGCRN/util.py","file_url":"https://github.com/tsinghua-fib-lab/Traffic-Benchmark/blob/HEAD/methods/DGCRN/util.py","link_basis":"plan_row","language":"python","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"9a7928795f74526c"}},{"code_sha256_prefix":"b2bde59f87bab41d","entry":"asym_adj","repo":"tsinghua-fib-lab/Traffic-Benchmark","repo_kind":"official","path":"methods/DGCRN/util.py","file_url":"https://github.com/tsinghua-fib-lab/Traffic-Benchmark/blob/HEAD/methods/DGCRN/util.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"b2bde59f87bab41d"}},{"code_sha256_prefix":"1ef18a710e2babf6","entry":"normal_std","repo":"tsinghua-fib-lab/Traffic-Benchmark","repo_kind":"official","path":"methods/DGCRN/util.py","file_url":"https://github.com/tsinghua-fib-lab/Traffic-Benchmark/blob/HEAD/methods/DGCRN/util.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1ef18a710e2babf6"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}