scholarly journals Urban Traffic Data Imputation With Detrending and Tensor Decomposition

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 11124-11137 ◽  
Author(s):  
Chuanfei Gong ◽  
Yaying Zhang
2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Yaxiong Han ◽  
Zhaocheng He

A crucial task in traffic data analysis is similarity pattern discovery, which is of great importance to urban mobility understanding and traffic management. Recently, a wide range of methods for similarities discovery have been proposed and the basic assumption of them is that traffic data is complete. However, missing data problem is inevitable in traffic data collection process due to a variety of reasons. In this paper, we propose the Bayesian nonparametric tensor decomposition (BNPTD) to achieve incomplete traffic data imputation and similarity pattern discovery simultaneously. BNPTD is a hierarchical probabilistic model, which is comprised of Bayesian tensor decomposition and Dirichlet process mixture model. Furthermore, we develop an efficient variational inference algorithm to learn the model. Extensive experiments were conducted on a smart card dataset collected in Guangzhou, China, demonstrating the effectiveness of our methods. It should be noted that the proposed BNPTD is universal and can also be applied to other spatiotemporal traffic data.


2021 ◽  
pp. 1-12
Author(s):  
Zhiyu Yan ◽  
Shuang Lv

Accurate prediction of traffic flow is of great significance for alleviating urban traffic congestions. Most previous studies used historical traffic data, in which only one model or algorithm was adopted by the whole prediction space and the differences in various regions were ignored. In this context, based on time and space heterogeneity, a Classification and Regression Trees-K-Nearest Neighbor (CART-KNN) Hybrid Prediction model was proposed to predict short-term taxi demand. Firstly, a concentric partitioning method was applied to divide the test area into discrete small areas according to its boarding density level. Then the CART model was used to divide the dataset of each area according to its temporal characteristics, and KNN was established for each subset by using the corresponding boarding density data to estimate the parameters of the KNN model. Finally, the proposed method was tested on the New York City Taxi and Limousine Commission (TLC) data, and the traditional KNN model, backpropagation (BP) neural network, long-short term memory model (LSTM) were used to compare with the proposed CART-KNN model. The selected models were used to predict the demand for taxis in New York City, and the Kriging Interpolation was used to obtain all the regional predictions. From the results, it can be suggested that the proposed CART-KNN model performed better than other general models by showing smaller mean absolute percentage error (MAPE) and root mean square error (RMSE) value. The improvement of prediction accuracy of CART-KNN model is helpful to understand the regional demand pattern to partition the boarding density data from the time and space dimensions. The partition method can be extended into many models using traffic data.


Sign in / Sign up

Export Citation Format

Share Document