Xinyu Chen

Xinyu Chen

Auto-generated profile, based on publicly available information

Xinyu Chen

Massachusetts Institute of Technology, Cambridge, USA

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2019 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
XCXinyu Chen
Xinyu Chen
ZHZhaocheng He
Zhaocheng He
LSLijun Sun
Lijun Sun

17 March 2021 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Verified
Journal Article
Closed access
XCXinyu Chen
Xinyu Chen
LSLijun Sun
Lijun Sun
Large-scale and multidimensional spatiotemporal data sets are becoming ubiquitous in many real-world applications such as monitoring urban traffic and air quality. Making predictions on these time series has become a critical challenge due to not only the large-scale and high-dimensional nature but also the considerable amount of missing data. In this paper, we propose a Bayesian temporal factorization (BTF) framework for modeling multidimensional time series—in particular spatiotemporal data—in the presence of missing values. By integrating low-rank matrix/tensor factorization and vector autoregressive (VAR) process into a single probabilistic graphical model, this framework can characterize both global and local consistencies in large-scale time series data. The graphical model allows us to effectively perform probabilistic predictions and produce uncertainty estimates without imputing those missing values. We develop efficient Gibbs sampling algorithms for model inference and model updating for real-time prediction and test the proposed BTF framework on several real-world spatiotemporal data sets for both missing data imputation and multi-step rolling prediction tasks. The numerical experiments demonstrate the superiority of the proposed BTF approaches over existing state-of-the-art methods.

27 September 2021 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
XCXinyu Chen
Xinyu Chen
MLMengying Lei
Mengying Lei
NSNicolas Saunier
Nicolas Saunier
LSLijun Sun
Lijun Sun
Spatiotemporal traffic time series (e.g., traffic volume/speed) collected from sensing systems are often incomplete with considerable corruption and large amounts of missing values, preventing users from harnessing the full power of the data. Missing data imputation has been a long-standing research topic and critical application for real-world intelligent transportation systems. A widely applied imputation method is low-rank matrix/tensor completion; however, the low-rank assumption only preserves the global structure while ignores the strong local consistency in spatiotemporal data. In this paper, we propose a low-rank autoregressive tensor completion (LATC) framework by introducing temporal variation as a new regularization term into the completion of a third-order (sensor $\times $ time of day $\times $ day) tensor. The third-order tensor structure allows us to better capture the global consistency of traffic data, such as the inherent seasonality and day-to-day similarity. To achieve local consistency, we design the temporal variation by imposing an autoregressive model for each time series with coefficients as learnable parameters. Different from previous spatial and temporal regularization schemes, the minimization of temporal variation can better characterize temporal generative mechanisms beyond local smoothness, allowing us to deal with more challenging scenarios such as “blackout” missing. To solve the optimization problem in LATC, we introduce an alternating minimization scheme that estimates the low-rank tensor and autoregressive coefficients iteratively. We conduct extensive numerical experiments on several real-world traffic data sets, and our results demonstrate the effectiveness of LATC in diverse missing scenarios.

1 July 2019 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
XCXinyu Chen
Xinyu Chen
ZHZhaocheng He
Zhaocheng He
YCYixian Chen
Yixian Chen
YLYuhuan Lu
Yuhuan Lu
JWJiawei Wang
Jiawei Wang

1 January 2018 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
XCXinyu Chen
Xinyu Chen
ZHZhaocheng He
Zhaocheng He
JWJiawei Wang
Jiawei Wang

27 June 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
XCXinyu Chen
Xinyu Chen
ZCZhanhong Cheng
Zhanhong Cheng
HCHanQin Cai
HanQin Cai
NSNicolas Saunier
Nicolas Saunier
LSLijun Sun
Lijun Sun
Spatiotemporal traffic data imputation is of great significance in intelligent transportation systems and data-driven decision-making processes. To perform efficient learning and accurate reconstruction from partially observed traffic data, we assert the importance of characterizing both global and local trends in time series. In the literature, substantial works have demonstrated the effectiveness of utilizing the low-rank property of traffic data by matrix/tensor completion models. In this study, we first introduce a Laplacian kernel to temporal regularization for characterizing local trends in traffic time series, which can be formulated as a circular convolution. Then, we develop a low-rank Laplacian convolutional representation (LCR) model by putting the circulant matrix nuclear norm and the Laplacian kernelized temporal regularization together, which is proved to meet a unified framework that has a fast Fourier transform (FFT) solution in log-linear time complexity. Through extensive experiments on several traffic datasets, we demonstrate the superiority of LCR over several baseline models for imputing traffic time series of various time series behaviors (e.g., data noises and strong/weak periodicity) and reconstructing sparse speed fields of vehicular traffic flow. The proposed LCR model is also an efficient solution to large-scale traffic data imputation over the existing imputation models.