Time-Dependent Trajectory Regression on Road Networks via Multi-Task Learning
暂无分享,去创建一个
[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 .