Time-Dependent Trajectory Regression on Road Networks via Multi-Task Learning

Road travel costs are important knowledge hidden in large-scale GPS trajectory data sets, the discovery of which can benefit many applications such as intelligent route planning and automatic driving navigation. While there are previous studies which tackled this task by modeling it as a regression problem with spatial smoothness taken into account, they unreasonably assumed that the latent cost of each road remains unchanged over time. Other works on route planning and recommendation that have considered temporal factors simply assumed that the temporal dynamics be known in advance as a parametric function over time, which is not faithful to reality. To overcome these limitations, in this paper, we propose an extension to a previous static trajectory regression framework by learning the temporal dynamics of road travel costs in an innovative non-parametric manner which can effectively overcome the temporal sparsity problem. In particular, we unify multiple different trajectory regression problems in a multi-task framework by introducing a novel crosstask regularization which encourages temporal smoothness on the change of road travel costs. We then propose an efficient block coordinate descent method to solve the resulting problem by exploiting its separable structures and prove its convergence to global optimum. Experiments conducted on both synthetic and real data sets demonstrate the effectiveness of our method and its improved accuracy on travel time prediction.

[1]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[2]  Massimiliano Pontil,et al.  Regularized multi--task learning , 2004, KDD.

[3]  K. Nachtigall Time depending shortest-path problems with applications to railway networks , 1995 .

[4]  Masashi Sugiyama,et al.  Trajectory Regression on Road Networks , 2011, AAAI.

[5]  Dit-Yan Yeung,et al.  A Convex Formulation for Learning Task Relationships in Multi-Task Learning , 2010, UAI.

[6]  P. Tseng Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .

[7]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[8]  Xing Xie,et al.  T-drive: driving directions based on taxi trajectories , 2010, GIS '10.

[9]  R. Tibshirani,et al.  Sparsity and smoothness via the fused lasso , 2005 .

[10]  Massimiliano Pontil,et al.  Convex multi-task feature learning , 2008, Machine Learning.

[11]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[12]  Jiawei Han,et al.  Adaptive Fastest Path Computation on a Road Network: A Traffic Mining Approach , 2007, VLDB.

[13]  A. Auslender Optimisation : méthodes numériques , 1976 .

[14]  Tsuyoshi Idé,et al.  Travel-Time Prediction Using Gaussian Process Regression: A Trajectory-Based Approach , 2009, SDM.

[15]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[16]  Wenjiang J. Fu Penalized Regressions: The Bridge versus the Lasso , 1998 .