{"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/rgdan-a-random-graph-diffusion-attention","title":"RGDAN: A random graph diffusion attention network for traffic prediction","arxiv_id":null,"date":"2024-01-16","proceeding":"journal 2024 1","authors":["Jin Fan","Wenchao Weng","Hao Tian","Huifeng Wu","Fu Zhu","Jia Wu"],"abstract":"Traffic Prediction based on graph structures is a challenging task given that road networks are typically complex structures and the data to be analyzed contains variable temporal features. Further, the quality of the spatial feature extraction is highly dependent on the weight settings of the graph structures. In the transportation field, the weights of these graph structures are currently calculated based on factors like the distance between roads. However, these methods do not take into account the characteristics of the road itself or the correlations between different traffic flows. Existing approaches usually pay more attention to local spatial dependencies extraction while global spatial dependencies are ignored. Another major problem is how to extract sufficient information at limited depth of graph structures. To address these challenges, we propose a Random Graph Diffusion Attention Network (RGDAN) for traffic prediction. RGDAN comprises a graph diffusion attention module and a temporal attention module. The graph diffusion attention module can adjust its weights by learning from data like a CNN to capture more realistic spatial dependencies. The temporal attention module captures the temporal correlations. Experiments on three large-scale public datasets demonstrate that RGDAN produces predictions with 2%–5% more precision than state-of-the-art methods.","url_abs":"https://doi.org/10.1016/j.neunet.2023.106093","url_pdf":"https://doi.org/10.1016/j.neunet.2023.106093","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":"rgdan-a-random-graph-diffusion-attention","repo_url":"https://github.com/wengwenchao123/RGDAN","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"}],"methods":[{"method_slug":"diffusion","method_name":"Diffusion"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/traffic-prediction-on-metr-la","task":"Traffic Prediction","dataset":"METR-LA","model":"RGDAN","rank_in_archive_order":11,"of":20,"metrics":{"MAE @ 12 step":"3.40","MAE @ 3 step":"2.69"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-ne-bj","task":"Traffic Prediction","dataset":"NE-BJ","model":"RGDAN","rank_in_archive_order":1,"of":6,"metrics":{"12 steps MAE":"4.68"},"uses_additional_data":false},{"leaderboard":"/sota/traffic-prediction-on-pems-bay","task":"Traffic Prediction","dataset":"PEMS-BAY","model":"RGDAN","rank_in_archive_order":7,"of":16,"metrics":{"MAE @ 12 step":"1.86"},"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/RGDAN","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":"0862d2f9f847fb09b23ef33a18e75cdbd8039a173c34e046a30bd82d0698be5f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}