3260 papers • 126 benchmarks • 313 datasets
This task has no description! Would you like to contribute one?
(Image credit: Papersgraph)
These leaderboards are used to track progress in traffic-data-imputation-11
Use these libraries to find traffic-data-imputation-11 models and implementations
No subtasks available.
BRITS is a novel method based on recurrent neural networks for missing value imputation in time series data that directly learns the missing values in a bidirectional recurrent dynamical system, without any specific assumption.
A scalable tensor learning model based on the existing framework of Low-Rank Tensor Completion, which is well-suited for spatiotemporal traffic data that is characterized by multidimensional structure of location, and can achieve competitive accuracy with a significantly lower computational cost.
A novel graph neural network architecture is introduced, named GRIN, which aims at reconstructing missing data in the different channels of a multivariate time series by learning spatio-temporal representations through message passing and outperforms state-of-the-art methods in the imputation task on relevant real-world benchmarks.
This paper proposes a novel class of attention-based architectures that, given a set of highly sparse discrete observations, learn a representation for points in time and space by exploiting a spatiotemporal propagation architecture aligned with the imputation task.
The results show that with probe vehicle penetration levels as low as 5%, the proposed estimation method can provide a sound reconstruction of macroscopic traffic speeds and reproduce realistic shockwave patterns, implying applicability in a variety of traffic conditions.
This paper formulate the missing data imputation problem in spatiotemporal traffic data in a low-rank tensor completion (LRTC) framework and define a novel truncated nuclear norm (TNN) on traffic tensors of location $\times$day$\times $time of day.
A low-rank autoregressive tensor completion (LATC) framework is proposed by introducing temporal variation as a new regularization term into the completion of a third-order tensor structure to better capture the global consistency of traffic data, such as the inherent seasonality and day-to-day similarity.
An innovative nonconvex truncated Schatten p-norm for tensors (TSpN) is defined to approximate tensor rank and impute missing spatiotemporal traffic data under the LRTC framework and derives the global optimal solutions by integrating the alternating direction method of multipliers with generalized soft-thresholding (GST).
Adding a benchmark result helps the community track progress.