4.7 Article

A Customized Data Fusion Tensor Approach for Interval-Wise Missing Network Volume Imputation

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TITS.2023.3289193

Keywords

Interval-wise missing imputation; DFCP tensor; regularization solution; Bayesian optimization; LPR; cellphone data

Ask authors/readers for more resources

In this paper, a tensor decomposition framework called data fusion CANDECOMP/PARAFAC (DFCP) is proposed to combine vehicle license plate recognition (LPR) data and cellphone location (CL) data for interval-wise missing volume imputation on urban networks. Numerical experiments show that our proposed method significantly outperforms the imputation method using LPR data only, and a sensitivity analysis demonstrates the robustness of the model performance.
Traffic missing data imputation is a fundamental demand and crucial application for real-world intelligent transportation systems. The wide imputation methods in different missing patterns have demonstrated the superiority of tensor learning by effectively characterizing complex spatiotemporal correlations. However, interval-wise missing volume scenarios remain a challenging topic, in particular for long-term continuous missing and high-dimensional data with complex missing mechanisms and patterns. In this paper, we propose a customized tensor decomposition framework, named the data fusion CANDECOMP/PARAFAC (DFCP) tensor decomposition, to combine vehicle license plate recognition (LPR) data and cellphone location (CL) data for the interval-wise missing volume imputation on urban networks. Benefiting from the unique advantages of CL data in the wide spatiotemporal coverage and correlates highly with real-world traffic states, it is fused into vehicle license plate recognition (LPR) data imputation. They are regarded as data types dimension, combined with other dimensions (different segments, time, days), we innovatively design a 4-way low-n-rank tensor decomposition for data reconstruction. Furthermore, to deal with the diverse disturbances in different data dimensions, we derive a regularization penalty coefficient in data imputation. Different from existing regularization schemes, we further introduce Bayesian optimization (BO) to enhance the performance in the non-convexity of the objective function in our regularized hyperparametric solutions during tensor decomposition. Numerical experiments highlight that our proposed method, combining CL and LPR data, significantly outperforms the imputation method using LPR data only. And a sensitivity analysis with varying missing length and rate scenarios demonstrates the robustness of model performance.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available