Pattern-Matching Dynamic Memory Network for Dual-Mode Traffic Prediction

In recent years, deep learning has increasingly gained attention in the field of traffic prediction. Existing traffic prediction models often rely on GCNs or attention mechanisms with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i><sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>) complexity to dynamically extract traffic node features, which lack efficiency and are not lightweight. Additionally, these models typically only utilize historical data for prediction, without considering the impact of the target information on the prediction. To address these issues, we propose a Pattern-Matching Dynamic Memory Network (PM-DMNet). Unlike traditional attention and graph convolution-based approaches, PM-DMNet employs a novel dynamic memory network that stores the most representative traffic patterns from historical data in a memory matrix through training. It captures traffic pattern features by comparing the similarity between the memory matrix and the current traffic state. This method not only achieves excellent predictive performance but also significantly reduces computational complexity to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>). The PM-DMNet also introduces two prediction methods: Recursive Multi-step Prediction (RMP) and Parallel Multi-step Prediction (PMP), which leverage the time features of the prediction targets to assist in the prediction process. Furthermore, a transfer attention mechanism is integrated into PMP, transforming historical data features to better align with the predicted target states, thereby capturing trend changes more accurately and reducing errors. Extensive experiments demonstrate the superiority of the proposed model over existing benchmarks. The source codes are available at: https://github.com/wengwenchao123/PM-DMNet

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2025-05-07
DOI
https://doi.org/10.1109/tits.2025.3564564
Citations
12
Primary Topic
Traffic Prediction and Management Techniques
Type
article
Field-Weighted Citation Impact
12.08

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Pattern-Matching Dynamic Memory Network for Dual-Mode Traffic Prediction

Wanzeng Kong, Mei Wu, Xiangjie Kong, Wenchao Weng et al.
12 citations
IEEE Transactions on Intelligent Transportation Systems
Traffic Prediction and Management Techniques
12.08
article

Pattern-Matching Dynamic Memory Network for Dual-Mode Traffic Prediction

Wanzeng Kong, Mei Wu, Xiangjie Kong, Wenchao Weng, Feng Xia, Hanyu Jiang
article en
12 citations

Abstract

In recent years, deep learning has increasingly gained attention in the field of traffic prediction. Existing traffic prediction models often rely on GCNs or attention mechanisms with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i><sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup>) complexity to dynamically extract traffic node features, which lack efficiency and are not lightweight. Additionally, these models typically only utilize historical data for prediction, without considering the impact of the target information on the prediction. To address these issues, we propose a Pattern-Matching Dynamic Memory Network (PM-DMNet). Unlike traditional attention and graph convolution-based approaches, PM-DMNet employs a novel dynamic memory network that stores the most representative traffic patterns from historical data in a memory matrix through training. It captures traffic pattern features by comparing the similarity between the memory matrix and the current traffic state. This method not only achieves excellent predictive performance but also significantly reduces computational complexity to <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">O</i>(<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>). The PM-DMNet also introduces two prediction methods: Recursive Multi-step Prediction (RMP) and Parallel Multi-step Prediction (PMP), which leverage the time features of the prediction targets to assist in the prediction process. Furthermore, a transfer attention mechanism is integrated into PMP, transforming historical data features to better align with the predicted target states, thereby capturing trend changes more accurately and reducing errors. Extensive experiments demonstrate the superiority of the proposed model over existing benchmarks. The source codes are available at: https://github.com/wengwenchao123/PM-DMNet

IEEE Transactions on Intelligent Transportation SystemsVol. 26(9)
Hangzhou Dianzi University (CN), Zhejiang University of Technology (CN), RMIT University (AU)
National Natural Science Foundation of China
Openalex Percentile: Top 1%
Traffic Prediction and Management Techniques
12.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.