.png){kind=icon}
.png){kind=icon}
Return
Tucker factorization-based tensor completion for robust traffic data imputation
.png){kind=icon}
OA
AI
DOI：10.1016/j.trc.2024.104502.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Missing values are prevalent in spatio-temporal traffic data, undermining the quality of datadriven analysis. While prior works have demonstrated the promise of tensor completion methods for imputation, their performance remains limited for complicated composite missing patterns. This paper proposes a novel imputation framework combining tensor factorization and rank minimization, which is effective in capturing key traffic dynamics and eliminates the need for exhaustive rank tuning. The framework is further supplemented with time series decomposition to account for trends, spatio-temporal correlations, and outliers, with the intention of improving the robustness of imputation results. A Bregman ADMM algorithm is designed to solve the resulting multi -block nonconvex optimization efficiently. Experiments on four real -world traffic state datasets suggest that the proposed framework outperforms state-of-the-art imputation methods, including the context of complex missing patterns with high missing rates, while maintaining reasonable computation efficiency. Furthermore, the robustness of our model in extreme missing data scenarios, as well as under perturbation in hyperparameters, has been validated. These results also underscore the potential benefits of incorporating temporal modeling for more reliable imputation.
Keywords:
Tensor completion
Tucker factorization
Data imputation
Changepoint detection
Bregman ADMM
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.9
Papers:
4.7K
Citations:
3.2W