Spatiotemporal Regularized Tucker Decomposition Approach for Traffic
Data Imputation
- URL: http://arxiv.org/abs/2305.06563v4
- Date: Tue, 31 Oct 2023 01:18:16 GMT
- Title: Spatiotemporal Regularized Tucker Decomposition Approach for Traffic
Data Imputation
- Authors: Wenwu Gong, Zhejun Huang, and Lili Yang
- Abstract summary: In intelligent transportation systems, traffic data imputation estimating the missing value from partially observed data is an inevitable challenging task.
Previous studies have not fully considered traffic data's multidimensionality and correlations, but they are vital to data recovery, especially for high-level missing scenarios.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: In intelligent transportation systems, traffic data imputation, estimating
the missing value from partially observed data is an inevitable and challenging
task. Previous studies have not fully considered traffic data's
multidimensionality and spatiotemporal correlations, but they are vital to
traffic data recovery, especially for high-level missing scenarios. To address
this problem, we propose a novel spatiotemporal regularized Tucker
decomposition method. First, the traffic matrix is converted into a third-order
tensor. Then, based on Tucker decomposition, the tensor is approximated by
multiplying non-negative factor matrices with a sparse core tensor. Notably, we
do not need to set the tensor rank or determine it through matrix nuclear-norm
minimization or tensor rank minimization. The low rankness is characterized by
the $l_1$-norm of the core tensor, while the manifold regularization and
temporal constraint are employed to capture spatiotemporal correlations and
further improve imputation performance. We use an alternating proximal gradient
method with guaranteed convergence to address the proposed model. Numerical
experiments show that our proposal outperforms matrix-based and tensor-based
baselines on real-world spatiotemporal traffic datasets in various missing
scenarios.
Related papers
- Revisiting Trace Norm Minimization for Tensor Tucker Completion: A Direct Multilinear Rank Learning Approach [22.740653766104153]
This paper shows that trace norm-based formulations in Tucker completion are inefficient in multilinear rank minimization.
We propose a new interpretation of Tucker format such that trace norm minimization is applied to the factor matrices of the equivalent representation.
Numerical results are presented to show that the proposed algorithm exhibits significant improved performance in terms of multilinear rank learning.
arXiv Detail & Related papers (2024-09-08T15:44:00Z) - Instance-Dependent Generalization Bounds via Optimal Transport [51.71650746285469]
Existing generalization bounds fail to explain crucial factors that drive the generalization of modern neural networks.
We derive instance-dependent generalization bounds that depend on the local Lipschitz regularity of the learned prediction function in the data space.
We empirically analyze our generalization bounds for neural networks, showing that the bound values are meaningful and capture the effect of popular regularization methods during training.
arXiv Detail & Related papers (2022-11-02T16:39:42Z) - Orthogonal Matrix Retrieval with Spatial Consensus for 3D Unknown-View
Tomography [58.60249163402822]
Unknown-view tomography (UVT) reconstructs a 3D density map from its 2D projections at unknown, random orientations.
The proposed OMR is more robust and performs significantly better than the previous state-of-the-art OMR approach.
arXiv Detail & Related papers (2022-07-06T21:40:59Z) - Truncated tensor Schatten p-norm based approach for spatiotemporal
traffic data imputation with complicated missing patterns [77.34726150561087]
We introduce four complicated missing patterns, including missing and three fiber-like missing cases according to the mode-drivenn fibers.
Despite nonity of the objective function in our model, we derive the optimal solutions by integrating alternating data-mputation method of multipliers.
arXiv Detail & Related papers (2022-05-19T08:37:56Z) - Hankel-structured Tensor Robust PCA for Multivariate Traffic Time Series
Anomaly Detection [9.067182100565695]
This study proposes a Hankel-structured tensor version of RPCA for anomaly detection in spatial data.
We decompose the corrupted matrix into a low-rank Hankel tensor and a sparse matrix.
We evaluate the method by synthetic data and passenger flow time series.
arXiv Detail & Related papers (2021-10-08T19:35:39Z) - Imputation-Free Learning from Incomplete Observations [73.15386629370111]
We introduce the importance of guided gradient descent (IGSGD) method to train inference from inputs containing missing values without imputation.
We employ reinforcement learning (RL) to adjust the gradients used to train the models via back-propagation.
Our imputation-free predictions outperform the traditional two-step imputation-based predictions using state-of-the-art imputation methods.
arXiv Detail & Related papers (2021-07-05T12:44:39Z) - MTC: Multiresolution Tensor Completion from Partial and Coarse
Observations [49.931849672492305]
Existing completion formulation mostly relies on partial observations from a single tensor.
We propose an efficient Multi-resolution Completion model (MTC) to solve the problem.
arXiv Detail & Related papers (2021-06-14T02:20:03Z) - Scaling and Scalability: Provable Nonconvex Low-Rank Tensor Estimation
from Incomplete Measurements [30.395874385570007]
A fundamental task is to faithfully recover tensors from highly incomplete measurements.
We develop an algorithm to directly recover the tensor factors in the Tucker decomposition.
We show that it provably converges at a linear independent rate of the ground truth tensor for two canonical problems.
arXiv Detail & Related papers (2021-04-29T17:44:49Z) - Solving weakly supervised regression problem using low-rank manifold
regularization [77.34726150561087]
We solve a weakly supervised regression problem.
Under "weakly" we understand that for some training points the labels are known, for some unknown, and for others uncertain due to the presence of random noise or other reasons such as lack of resources.
In the numerical section, we applied the suggested method to artificial and real datasets using Monte-Carlo modeling.
arXiv Detail & Related papers (2021-04-13T23:21:01Z) - Low-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion [3.498620439731324]
We introduce a unified low-rank and sparse enhanced Tucker decomposition model for tensor completion.
Our model possesses a sparse regularization term to promote a sparse core tensor, which is beneficial for tensor data compression.
It is remarkable that our model is able to deal with different types of real-world data sets, since it exploits the potential periodicity and inherent correlation properties appeared in tensors.
arXiv Detail & Related papers (2020-10-01T12:45:39Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.