Weishan Kong , Yanni Ju , Shiyuan Zhang , Jun Wang , Liwei Huang , Hong Qu
{"title":"Graph enhanced spatial–temporal transformer for traffic flow forecasting","authors":"Weishan Kong , Yanni Ju , Shiyuan Zhang , Jun Wang , Liwei Huang , Hong Qu","doi":"10.1016/j.asoc.2025.112698","DOIUrl":null,"url":null,"abstract":"<div><div>Traffic flow forecasting, which aims to predict future traffic patterns based on current conditions, is a crucial yet challenging task in intelligent transportation systems due to the complex spatial–temporal relationships involved. Existing methods often struggle to effectively capture these intricate spatial dependencies and temporal patterns. To address these limitations, we propose a graph enhanced spatial–temporal Transformer (GE-STT), which integrates a graph enhanced module and a spatial–temporal Transformer module for improved prediction accuracy. Specifically, the graph enhanced module combines a Graph Convolutional Network (GCN) with a Gated Recurrent Unit (GRU) to obtain enriched spatial–temporal features, and introduce the original traffic data as a correction term to deal with the errors in the enhancement process. The spatial–temporal Transformer then leverages these enhanced features for final prediction. Experimental results on four traffic datasets show that GE-STT achieves superior performance under various metrics. Compared with the best baseline in different datasets, the performance of GE-STT is improved by up to 8% under the MAE metric, highlighting its robustness and effectiveness in traffic flow forecasting tasks.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"170 ","pages":"Article 112698"},"PeriodicalIF":7.2000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625000092","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Traffic flow forecasting, which aims to predict future traffic patterns based on current conditions, is a crucial yet challenging task in intelligent transportation systems due to the complex spatial–temporal relationships involved. Existing methods often struggle to effectively capture these intricate spatial dependencies and temporal patterns. To address these limitations, we propose a graph enhanced spatial–temporal Transformer (GE-STT), which integrates a graph enhanced module and a spatial–temporal Transformer module for improved prediction accuracy. Specifically, the graph enhanced module combines a Graph Convolutional Network (GCN) with a Gated Recurrent Unit (GRU) to obtain enriched spatial–temporal features, and introduce the original traffic data as a correction term to deal with the errors in the enhancement process. The spatial–temporal Transformer then leverages these enhanced features for final prediction. Experimental results on four traffic datasets show that GE-STT achieves superior performance under various metrics. Compared with the best baseline in different datasets, the performance of GE-STT is improved by up to 8% under the MAE metric, highlighting its robustness and effectiveness in traffic flow forecasting tasks.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.