{"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/a-decomposition-dynamic-graph-convolutional","title":"A Decomposition Dynamic graph convolutional recurrent network for traffic forecasting","arxiv_id":null,"date":"2023-05-01","proceeding":"Pattern Recognition 2023 5","authors":["Wenchao Weng; Jin Fan; Huifeng Wu; Yujie Hu; Hao Tian; Fu Zhu; Jia Wu"],"abstract":"Our daily lives are greatly impacted by traffic conditions, making it essential to have accurate predictions of traffic flow within a road network. Traffic signals used for forecasting are usually generated by sensors along roads, which can be represented as nodes on a graph. These sensors typically produce normal signals representing normal traffic flows and abnormal signals indicating unknown traffic disruptions. Graph convolution networks are widely used for traffic prediction due to their ability to capture correlations between network nodes. However, existing approaches use a predefined or adaptive adjacency matrix that does not accurately reflect real-world relationships between signals. To address this issue, we propose a decomposition dynamic graph convolutional recurrent network (DDGCRN) for traffic forecasting. DDGCRN combines a dynamic graph convolution recurrent network with an RNN-based model that generates dynamic graphs based on time-varying traffic signals, allowing for the extraction of both spatial and temporal features. Additionally, DDGCRN separates abnormal signals from normal traffic signals and models them using a data-driven approach to further improve predictions. Results from our analysis of six real-world datasets demonstrate the superiority of DDGCRN compared to the current state-of-the-art. The source codes are available at: https://github.com/wengwenchao123/DDGCRN.","url_abs":"https://www.sciencedirect.com/science/article/abs/pii/S0031320323003710","url_pdf":"https://www.sciencedirect.com/science/article/abs/pii/S0031320323003710","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":"a-decomposition-dynamic-graph-convolutional","repo_url":"https://github.com/wengwenchao123/DDGCRN","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/traffic-prediction-on-pems04","task":"Traffic Prediction","dataset":"PeMS04","model":"DDGCRN","rank_in_archive_order":8,"of":12,"metrics":{"12 Steps MAE":"18.45"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pems07","task":"Traffic Prediction","dataset":"PeMS07","model":"DDGCRN","rank_in_archive_order":9,"of":17,"metrics":{"MAE@1h":"19.79"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pems08","task":"Traffic Prediction","dataset":"PeMS08","model":"DDGCRN","rank_in_archive_order":12,"of":13,"metrics":{"MAE@1h":"14.40"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd3","task":"Traffic Prediction","dataset":"PeMSD3","model":"DDGCRN","rank_in_archive_order":3,"of":6,"metrics":{"12 steps MAE":"14.63","12 steps MAPE":"14.22","12 steps RMSE":"25.07"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd4","task":"Traffic Prediction","dataset":"PeMSD4","model":"DDGCRN","rank_in_archive_order":8,"of":13,"metrics":{"12 steps MAE":"18.45"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd7","task":"Traffic Prediction","dataset":"PeMSD7","model":"DDGCRN","rank_in_archive_order":5,"of":8,"metrics":{"12 steps MAE":"19.79"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd7-l","task":"Traffic Prediction","dataset":"PeMSD7(L)","model":"DDGCRN","rank_in_archive_order":2,"of":6,"metrics":{"12 steps MAE":"2.79","12 steps MAPE":"7.06","12 steps RMSE":"5.68"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd7-m","task":"Traffic Prediction","dataset":"PeMSD7(M)","model":"DDGCRN","rank_in_archive_order":2,"of":7,"metrics":{"12 steps MAE":"2.59","12 steps MAPE":"6.48","12 steps RMSE":"5.21"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pemsd8","task":"Traffic Prediction","dataset":"PeMSD8","model":"DDGCRN","rank_in_archive_order":10,"of":13,"metrics":{"12 steps MAE":"14.40"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"wengwenchao123/DDGCRN","kind":"named_in_paper","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":"324a47c7bb4c794c4f018c1b57e125f857b919df2d7185b0771c503699b30d64","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}