Robust Tensor Ring Decomposition for Urban Traffic Data Imputation

In urban transportation systems, missing data and noise contamination are almost inevitable. To address the challenge of imputing traffic data corrupted by noise and outliers in real-world scenarios, this paper proposes a novel algorithm based on spatiotemporal tensor completion. The proposed method transforms observed data into three-dimensional spatiotemporal tensors and utilizes tensor ring decomposition for data completion. Furthermore, spatial and temporal information is incorporated into the model by utilizing the graph Laplacian matrix. To handle outliers, they are treated as unknown parameters, and the ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-norm is introduced to ensure their sparsity, thereby achieving the Spatio-Temporal Tensor Completion model with ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-norm term (STTC-ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>). The solution to the model is derived using the alternating optimization framework with the alternating direction method of multipliers. Then, we discuss the convergence of the solution method. To further enhance the efficiency of our proposed method, we combine the unrolling algorithm with our iterative optimization model, creating a lightweight and efficient neural network tailored for tensor completion, called STTC-ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-NN. Extensive experiments conducted on real datasets demonstrate the superiority of our proposed method over several state-of-the-art methods across various experimental scenarios. It is worth noting that STTC-ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-NN reduces computational time by one to two orders of magnitude compared to existing methods while maintaining or even improving imputation accuracy. The code is available at https://github.com/TCCofWANG/STTC-L0-and-STTC-L0-NN.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2025-04-14
DOI
https://doi.org/10.1109/tits.2025.3555449
Citations
3
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
4.60

Funders

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

Robust Tensor Ring Decomposition for Urban Traffic Data Imputation

Yuxin He, C. Y. Guan, Chi-Sing Leung, Linfang Yu et al.
3 citations
IEEE Transactions on Intelligent Transportation Systems
Tensor decomposition and applications
4.60
article

Robust Tensor Ring Decomposition for Urban Traffic Data Imputation

Yuxin He, C. Y. Guan, Chi-Sing Leung, Linfang Yu, Wenming Cao, Hao Wang
article en
3 citations

Abstract

In urban transportation systems, missing data and noise contamination are almost inevitable. To address the challenge of imputing traffic data corrupted by noise and outliers in real-world scenarios, this paper proposes a novel algorithm based on spatiotemporal tensor completion. The proposed method transforms observed data into three-dimensional spatiotemporal tensors and utilizes tensor ring decomposition for data completion. Furthermore, spatial and temporal information is incorporated into the model by utilizing the graph Laplacian matrix. To handle outliers, they are treated as unknown parameters, and the ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-norm is introduced to ensure their sparsity, thereby achieving the Spatio-Temporal Tensor Completion model with ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-norm term (STTC-ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>). The solution to the model is derived using the alternating optimization framework with the alternating direction method of multipliers. Then, we discuss the convergence of the solution method. To further enhance the efficiency of our proposed method, we combine the unrolling algorithm with our iterative optimization model, creating a lightweight and efficient neural network tailored for tensor completion, called STTC-ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-NN. Extensive experiments conducted on real datasets demonstrate the superiority of our proposed method over several state-of-the-art methods across various experimental scenarios. It is worth noting that STTC-ℓ<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub>-NN reduces computational time by one to two orders of magnitude compared to existing methods while maintaining or even improving imputation accuracy. The code is available at https://github.com/TCCofWANG/STTC-L0-and-STTC-L0-NN.

IEEE Transactions on Intelligent Transportation SystemsVol. 26(6)
City University of Hong Kong (HK), Shenzhen University (CN), Shenzhen Technology University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Guangdong Province
Sustainable cities and communities
Openalex Percentile: Top 5%
Tensor decomposition and applications
4.60
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.