Truncated tensor Schatten p-norm based approach for spatiotemporal traffic data imputation with complicated missing patterns

by   Tong Nie, et al.

Rapid advances in sensor, wireless communication, cloud computing and data science have brought unprecedented amount of data to assist transportation engineers and researchers in making better decisions. However, traffic data in reality often has corrupted or incomplete values due to detector and communication malfunctions. Data imputation is thus required to ensure the effectiveness of downstream data-driven applications. To this end, numerous tensor-based methods treating the imputation problem as the low-rank tensor completion (LRTC) have been attempted in previous works. To tackle rank minimization, which is at the core of the LRTC, most of aforementioned methods utilize the tensor nuclear norm (NN) as a convex surrogate for the minimization. However, the over-relaxation issue in NN refrains it from desirable performance in practice. In this paper, we define an innovative nonconvex truncated Schatten p-norm for tensors (TSpN) to approximate tensor rank and impute missing spatiotemporal traffic data under the LRTC framework. We model traffic data into a third-order tensor structure of (time intervals,locations (sensors),days) and introduce four complicated missing patterns, including random missing and three fiber-like missing cases according to the tensor mode-n fibers. Despite nonconvexity of the objective function in our model, we derive the global optimal solutions by integrating the alternating direction method of multipliers (ADMM) with generalized soft-thresholding (GST). In addition, we design a truncation rate decay strategy to deal with varying missing rate scenarios. Comprehensive experiments are finally conducted using real-world spatiotemporal datasets, which demonstrate that the proposed LRTC-TSpN method performs well under various missing cases, meanwhile outperforming other SOTA tensor-based imputation models in almost all scenarios.


page 7

page 8

page 13

page 16

page 21

page 22

page 28

page 29


A Nonconvex Low-Rank Tensor Completion Model for Spatiotemporal Traffic Data Imputation

Sparsity and missing data problems are very common in spatiotemporal tra...

Scalable Low-Rank Autoregressive Tensor Learning for Spatiotemporal Traffic Data Imputation

Missing value problem in spatiotemporal traffic data has long been a cha...

Manifold Regularized Tucker Decomposition Approach for Spatiotemporal Traffic Data Imputation

Spatiotemporal traffic data imputation (STDI), estimating the missing da...

A Parameter-free Nonconvex Low-rank Tensor Completion Model for Spatiotemporal Traffic Data Recovery

Traffic data chronically suffer from missing and corruption, leading to ...

Low-Rank Hankel Tensor Completion for Traffic Speed Estimation

This paper studies the traffic state estimation (TSE) problem using spar...

Incremental Bayesian tensor learning for structural monitoring data imputation and response forecasting

There has been increased interest in missing sensor data imputation, whi...

Spatiotemporal Tensor Completion for Improved Urban Traffic Imputation

Effective management of urban traffic is important for any smart city in...

Please sign up or login with your details

Forgot password? Click here to reset