基于非线性交通流的深度时空图预测模型研究
Research on Deep Spatial-Temporal Graph Prediction Model Based on Non-Linear Traffic Flow
DOI: 10.12677/csa.2026.168261, PDF,   
作者: 田 芮:大连东软信息学院应用技术学院,辽宁 大连;徐志昊:青岛大学计算机科学技术学院,山东 青岛;吕志强*:青岛理工大学人工智能学院,山东 青岛
关键词: 交通流预测方法时空模型图卷积网络信息聚合Traffic Flow Prediction Method Spatial-Temporal Model Graph Convolutional Network Information Integration
摘要: 在城市交通运营和管理中,快速、准确的交通流预测至关重要。传统的预测方法往往在处理由交通流的高非线性和复杂性带来的预测挑战方面存在不足,特别是在捕获交通流的动态空间关联性方面的缺失。图卷积网络被视为建立交通流的时空预测模型的关键技术之一。然而,在深度交通流时空预测模型中,这些模型往往面临过度平滑和梯度消失等问题。因此,本研究提出了一种深度时空图预测模型,重点解决了图卷积网络在交通流预测模型中的深度构建问题。该模型由一个结合了深度图卷积网络和时间卷积的时空预测模型组成,通过构建一种新式的可微广义聚合函数和残差连接策略,本研究实现了多层图卷积网络的信息聚合,并建立了一个能够捕获时间相关性特征的时间卷积模块。通过在真实交通数据集上的一系列实证测试,本研究验证了该模型的有效性超过了最新的基准方法,总体平均预测误差降低了30.4%。
Abstract: In urban traffic operation and management, swift and accurate traffic flow prediction holds immense importance. Traditional prediction methods often fall short in dealing with the prediction challenges brought by the high non-linearity and complexity of the traffic flow, especially lacking in deciphering the dynamic spatial correlations of the traffic flow. Graph convolutional networks are seen as the key technology to establish spatial-temporal prediction models for traffic flow. However, in deep traffic flow spatial-temporal prediction models, these models often face issues such as over-smoothing and gradient vanishing. Therefore, this study proposes a deep graph spatial-temporal prediction model, focusing on addressing the issue of the depth construction of graph convolutional networks in traffic flow prediction models. This model consists of a spatial-temporal prediction model that combines deep graph convolutional networks and temporal convolution. By constructing a differentiable generalized aggregation function and a residual connection strategy, this study realizes the information integration of multiple layers of the graph convolutional network. Simultaneously, by introducing the convolution mechanism, it establishes a temporal convolution module capable of capturing time-related characteristics. Through a series of empirical tests on genuine traffic datasets, this study validates that the model effectiveness exceeds the latest benchmark methods, and on the whole, the predictive error is reduced within the range of 30.4%.
文章引用:田芮, 徐志昊, 吕志强. 基于非线性交通流的深度时空图预测模型研究[J]. 计算机科学与应用, 2026, 16(8): 48-59. https://doi.org/10.12677/csa.2026.168261

参考文献

[1] 叶宝林, 戴本岙, 张鸣剑, 等. 基于图卷积网络的交通流预测方法综述[J]. 南京信息工程大学学报, 2024, 16(3): 291-310.
[2] 刘建敏, 林晖, 汪晓丁, 等. 基于图注意力机制的无地图场景轨迹预测方法[J]. 计算机工程, 2024, 50(7): 144-153.
[3] ud din, A.M. and Qureshi, S. (2024) Limits of Depth: Over-Smoothing and Over-Squashing in GNNs. Big Data Mining and Analytics, 7, 205-216.
https://doi.org/10.26599/bdma.2023.9020019
[4] 王竟成, 张勇, 胡永利, 等. 基于图卷积网络的交通预测综述[J]. 北京工业大学学报, 2021, 47(8): 954-970.
[5] Li, J., Zhang, Q.R., Liu, W.X., Chan, A.B. and Fu, Y.G. (2024) Another Perspective of Over-Smoothing: Alleviating Semantic Over-Smoothing in Deep GNNs. IEEE Transactions on Neural Networks and Learning Systems, 36, 6897-6910.
[6] 崔建勋, 要甲, 赵泊媛. 基于深度学习的短期交通流预测方法综述[J]. 交通运输工程学报, 2024, 24(2): 50-64.
[7] Gasteiger, J., Bojchevski, A. and Gunnemann, S. (2018) Predict Then Propagate: Graph Neural Networks Meet Personalized PageRank. arXiv: 1810.05997.
[8] Bojchevski, A., Klicpera, J., Perozzi, B., et al. (2019) Is PageRank All You Need for Scalable Graph Neural Networks. ACM KDD, MLG Workshop, Anchorage, 5 August 2019, 1-7.
[9] Cai, K.Q., Li, Y., Zhu, Y.W., Fang, Q., Yang, Y. and Du, W. (2023) A Geographical and Operational Deep Graph Convolutional Approach for Flight Delay Prediction. Chinese Journal of Aeronautics, 36, 357-367.
https://doi.org/10.1016/j.cja.2022.10.004
[10] Giraldo, M., Restrepo, J.C., Huertas, J., Agudelo, J.R. and Agudelo, A.F. (2024) Signal Synchronization Methods When Measuring Tailpipe Emissions with PEMs. Transportation Research Part D: Transport and Environment, 129, Article ID: 104154.
https://doi.org/10.1016/j.trd.2024.104154
[11] Chen, J., Shi, J. and Xu, R. (2024) Dual Subspace Manifold Learning Based on GCN for Intensity-Invariant Facial Expression Recognition. Pattern Recognition, 148, Article ID: 110157.
https://doi.org/10.1016/j.patcog.2023.110157
[12] Chen, K., Liu, S., Zhu, T., Qiao, J., Su, Y., Tian, Y., et al. (2023) Improving Expressivity of GNNs with Subgraph-Specific Factor Embedded Normalization. Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Long Beach, 6-10 August 2023, 237-249.
https://doi.org/10.1145/3580305.3599388
[13] 刘建伟, 赵会丹, 罗雄麟, 等. 深度学习批归一化及其相关算法研究进展[J]. 自动化学报, 2020, 46(6): 1090-1120.
[14] Li, G., Muller, M., Thabet, A. and Ghanem, B. (2019) DeepGCNs: Can GCNs Go as Deep as CNNs? 2019 IEEE/CVF International Conference on Computer Vision (ICCV), Seoul, 27 October-2 November 2019, 9266-9275.
https://doi.org/10.1109/iccv.2019.00936
[15] He, K., Zhang, X., Ren, S. and Sun, J. (2016) Identity Mappings in Deep Residual Networks. In: Leibe, B., Matas, J., Sebe, N. and Welling, M., Eds., Computer VisionECCV 2016, Springer, 630-645.
https://doi.org/10.1007/978-3-319-46493-0_38
[16] Wen, X., Zeng, M., Chen, J., Maimaiti, M. and Liu, Q. (2023) Recognition of Wheat Leaf Diseases Using Lightweight Convolutional Neural Networks against Complex Backgrounds. Life, 13, Article 2125.
https://doi.org/10.3390/life13112125
[17] 何婷, 周艳秋, 辛春花. 基于时空位置关注图神经网络的交通流预测方法[J]. 计算机应用研究, 2024, 41(10): 2932-2938.
[18] Edlinger, A., Garland, G., Banerjee, S., Degrune, F., García‐Palacios, P., Herzog, C., et al. (2023) The Impact of Agricultural Management on Soil Aggregation and Carbon Storage Is Regulated by Climatic Thresholds across a 3000 km European Gradient. Global Change Biology, 29, 3177-3192.
https://doi.org/10.1111/gcb.16677
[19] Stiles, J., Kar, A., Lee, J. and Miller, H.J. (2023) Lower Volumes, Higher Speeds: Changes to Crash Type, Timing, and Severity on Urban Roads from COVID-19 Stay-at-Home Policies. Transportation Research Record: Journal of the Transportation Research Board, 2677, 15-27.
https://doi.org/10.1177/03611981211044454
[20] 史昕, 曹凤腾, 纪艺, 等. 基于多尺度时空特征和软注意力机制的交通流预测方法[J]. 计算机工程, 2024, 50(12): 346-357.