Spatiotemporal Traffic Data Imputation and Pattern Discovery with Bayesian Kernelized Probabilistic Matrix Factorization

Accepted by TRB 2020

Posted by Mengying Lei on March 29, 2021

You may find interesting:


Dynamic holding control to avoid bus bunching, A multi-agent deep reinforcement learning framework

Published in Transportation Research Part C


Multi-agent Graph Reinforcement Learning for Connected Automated Driving

Accepted by ICML 2020

Authors

Mengying Lei, Aurelie Labbe, Lijun Sun

Abstract

Spatiotemporal traffic data imputation is a fundamental challenge for data-driven transportation system analysis. In this paper, we propose a new Bayesian kernelized probabilistic matrix factorization (BKMF) model for spatiotemporal data completion, which can effectively incorporate data dependencies using Gaussian process (GP) kernel constrains. Specifically, we present a fully Bayesian framework for automatically learning model parameters as well as kernel hyperparameters based on Markov chain Monte Carlo (MCMC). By imposing the inferred GP regularizations over all rows/columns of latent components, the underlying spatiotemporal correlations/consistencies can be captured explicitly. Our model is first tested on a synthetic data to show the inference effectiveness for GP hyperparameters. Then, we conduct experiments on a publicly avaliable urban traffic speed data under the random missing scenario with various missing ratios. Our results show that the proposed BKMF model obtains interpretable spatiotemporal patterns and achieves higher imputation accuracy than state-of-the-art comparing methods.

Poster