Mining Dependencies Considering Time Lag in Spatio-Temporal Traffic Data

  • Xiabing Zhou
  • Haikun Hong
  • Xingxing Xing
  • Wenhao Huang
  • Kaigui BianEmail author
  • Kunqing Xie
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9098)


Learning dependency structure is meaningful to characterize causal or statistical relationships. Traditional dependencies learning algorithms only use the same time stamp data of variables. However, in many real-world applications, such as traffic system and climate, time lag is a key feature of hidden temporal dependencies, and plays an essential role in interpreting the cause of discovered temporal dependencies. In this paper, we propose a method for mining dependencies by considering the time lag. The proposed approach is based on a decomposition of the coefficients into products of two-level hierarchical coefficients, where one represents feature-level and the other represents time-level. Specially, we capture the prior information of time lag in spatio-temporal traffic data. We construct a probabilistic formulation by applying some probabilistic priors to these hierarchical coefficients, and devise an expectation-maximization (EM) algorithm to learn the model parameters. We evaluate our model on both synthetic and real-world highway traffic datasets. Experimental results show the effectiveness of our method.


Dependency Time lag Highway traffic analysis 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Moneta, A., Spirtes, P.: Graphical models for the identification of causal structures in multivariate time series models. In: JCIS (2006)Google Scholar
  2. 2.
    Friedman, N., Nachman, I., Per, D.: Learning bayesian network structure from massive datasets: the “sparse candidate” algorithm. In: Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, pp. 206–215 (1999)Google Scholar
  3. 3.
    Silva, R., Scheines, R., Glymour, C., Spirtes, P.: Learning the structure of linear latent variable models. The Journal of Machine Learning Research 7, 191–246 (2006)zbMATHMathSciNetGoogle Scholar
  4. 4.
    Spirtes, P., Glymour, C.N., Scheines, R.: Causation, prediction, and search, vol. 81. MIT press (2000)Google Scholar
  5. 5.
    Lee, S., Heydecker, B., Kim, Y.H., Shon, E.-Y.: Dynamic od estimation using three phase traffic flow theory. Journal of Advanced Transportation 45(2), 143–158 (2011)CrossRefGoogle Scholar
  6. 6.
    Barceló, J., Montero, L., Bullejos, M., Serch, O., Carmona, C.: A kalman filter approach for the estimation of time dependent od matrices exploiting bluetooth traffic data collection. In: Transportation Research Board 91st Annual Meeting, number 12–3843 (2012)Google Scholar
  7. 7.
    Zhao-cheng, H., Zhi, Y.: Dynamic od estimation model of urban network [j]. Journal of Traffic and Transportation Engineering 5(2), 94–98 (2005)Google Scholar
  8. 8.
    Han, L., Song, G., Cong, G., Xie, K.: Overlapping decomposition for causal graphical modeling. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2012, pp. 114–122 (2012)Google Scholar
  9. 9.
    Granger, C.W.J.: Testing for causality: a personal viewpoint. Journal of Economic Dynamics and control 2, 329–352 (1980)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society. Series B (Statistical Methodology) 68(1) (2006)Google Scholar
  11. 11.
    Li, F., Zhang, N.R.: Bayesian variable selection in structured high-dimensional covariate spaces with applications in genomics. Journal of the American Statistical Association 105(491), 1202–1214 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Bahadori, M.T., Liu, Y.: Granger causality analysis in irregular time series. In: SDM, pp. 660–671 (2012)Google Scholar
  13. 13.
    Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Statistical Society, Series B 39(1), 1–38 (1977)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Meinshausen, N., Bühlmann, P.: High-dimensional graphs and variable selection with the lasso. The Annals of Statistics, 1436–1462 (2006)Google Scholar
  15. 15.
    Gao, Y., Sun, S.: Multi-link traffic flow forecasting using neural networks. In: 2010 Sixth International Conference on Natural Computation (ICNC), vol. 1, pp. 398–401 (2010)Google Scholar
  16. 16.
    Sun, S., Huang, R., Gao, Y.: Network-scale traffic modeling and forecasting with graphical lasso and neural networks. Journal of Transportation Engineering 138(11), 1358–1367 (2012)CrossRefGoogle Scholar
  17. 17.
    Kawale, J., Liess, S., Kumar, V., Lall, U., Ganguly, A.: Mining time-lagged relationships in spatio-temporal climate data. In: 2012 Conference on Intelligent Data Understanding (CIDU), pp. 130–135 (2012)Google Scholar
  18. 18.
    Yang, S.: On feature selection for traffic congestion prediction. Transportation Research Part C: Emerging Technologies 26, 160–169 (2013)CrossRefGoogle Scholar
  19. 19.
    Tibshirani, R.: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological) 58, 267–288 (1996)zbMATHMathSciNetGoogle Scholar
  20. 20.
    Zhao, P., Rocha, G., Yu, B.: Grouped and hierarchical model selection through composite absolute penalties. Department of Statistics, UC Berkeley. Tech. Rep, 703 (2006)Google Scholar
  21. 21.
    Arnold, B.C., Brockett, P.L.: On distributions whose component ratios are cauchy. The American Statistician 46(1), 25–26 (1992)MathSciNetGoogle Scholar
  22. 22.
    Carvalho, C.M., Polson, N.G., Scott, J.G.: Handling sparsity via the horseshoe. In: International Conference on Artificial Intelligence and Statistics, pp. 73–80 (2009)Google Scholar
  23. 23.
    Hernández-Lobato, D., Hernández-Lobato, J.M., Dupont, P.: Generalized spike-and-slab priors for bayesian group feature selection using expectation propagation. The Journal of Machine Learning Research 14(1), 1891–1945 (2013)zbMATHGoogle Scholar
  24. 24.
    Qi, Y.A., Minka, T.P., Picard, R.W., Ghahramani, Z.: Predictive automatic relevance determination by expectation propagation. In: Proceedings of the Twenty-first International Conference on Machine Learning, ICML 2004, pp. 85–92 (2004)Google Scholar
  25. 25.
    Lange, K., Hunter, D.R., Yang, I.: Optimization transfer using surrogate objective functions. Journal of Computational and Graphical Statistics 9(1), 1–20 (2000)MathSciNetGoogle Scholar
  26. 26.
    Candes, E.J., Wakin, M.B., Boyd, S.P.: Enhancing sparsity by reweighted \(\ell _1\) minimization. Journal of Fourier analysis and applications 14(5–6), 877–905 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  27. 27.
    Wipf, D., Nagarajan, S.: Iterative reweighted \(\ell _{1}\) and \(\ell _{2}\) methods for finding sparse solutions. IEEE Journal of Selected Topics in Signal Processing 4(2), 317–329 (2010)CrossRefGoogle Scholar
  28. 28.
    Arnold, A., Liu, Y., Abe, N.: Temporal causal modeling with graphical granger methods. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2007, pp. 66–75 (2007)Google Scholar
  29. 29.
    Meng, S., Lei, H., Kunqing, X., Guojie, S., Xiujun, M., Guanhua, C.: An adaptive traffic flow prediction mechanism based on locally weighted learning. Acta Scientiarum Naturalium Universitatis Pekinensis 46(1), 64–68 (2010)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Xiabing Zhou
    • 1
  • Haikun Hong
    • 1
  • Xingxing Xing
    • 1
  • Wenhao Huang
    • 1
  • Kaigui Bian
    • 1
    Email author
  • Kunqing Xie
    • 1
  1. 1.Key Laboratory of Machine Perception, Ministry of EducationPeking UniversityBeijingChina

Personalised recommendations