{"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/bilinear-spatiotemporal-fusion-network-an","title":"Bilinear Spatiotemporal Fusion Network: An efficient approach for traffic flow prediction","arxiv_id":null,"date":"2025-04-01","proceeding":"Neural Networks 2025 4","authors":["Jing Chen","Shixiang Pan","Weimin Peng","Wenqiang Xu"],"abstract":"Accurate traffic flow forecasting is critical for intelligent transportation systems, yet increasing model complexity in spatiotemporal graph neural networks does not always yield proportional gains. In this paper, we present a Bilinear Spatiotemporal Fusion Network (BLSTF) tailored for stable, periodic traffic scenarios. First, a temporal enhancement module is introduced to mitigate multi-step error accumulation. Second, predefined graph priors with linear feedback leverage known road topologies for straightforward yet effective spatial modeling. Finally, a bilinear fusion mechanism seamlessly integrates refined temporal and spatial features with minimal computational overhead. Extensive experiments on four real-world datasets show that BLSTF outperforms state-of-the-art methods, achieving MAE and MAPE of 14.05 and 13.90% on PEMS03, 17.93 and 12.12% on PEMS04, 18.87 and 7.86% on PEMS07, and 13.49 and 8.71% on PEMS08, demonstrating BLSTF’s potential to deliver accurate, efficient, and interpretable traffic flow forecasts.","url_abs":"https://www.sciencedirect.com/science/article/pii/S0893608025002618?via%3Dihub","url_pdf":"https://www.sciencedirect.com/science/article/pii/S0893608025002618?via%3Dihub","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":"bilinear-spatiotemporal-fusion-network-an","repo_url":"https://github.com/psx1999/BLSTF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"spatio-temporal-forecasting","task_name":"Spatio-Temporal Forecasting"},{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"traffic-prediction","task_name":"Traffic Prediction"}],"methods":[{"method_slug":"mae","method_name":"MAE"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"psx1999/BLSTF","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":"2099c3cdf6e64d55d6b6466f17e10504648590048c80ff6d2e0206659504e461","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}