Advertisement

HV: A Feature Based Method for Trajectory Dataset Profiling

  • Wei Jiang
  • Jie Zhu
  • Jiajie Xu
  • Zhixu Li
  • Pengpeng Zhao
  • Lei ZhaoEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9418)

Abstract

The pervasiveness of location-acquisition and mobile computing techniques have generated massive spatial trajectory data, which has brought great challenges to the management and analysis of such a big data. In this paper, we focus on the trajectory dataset profiling problem, and aim to extract the representative trajectories from the raw trajectory as a subset, called profile, which can best describe the whole dataset. This problem is very challenging subject to finding the most representative trajectories set by trading off the profile size and quality. To tackle this problem, we model the features of the whole dataset from the aspects of density, speed and the directional tendency. Meanwhile we present our two kinds of methods to select the representative trajectories by the global heuristic voting (HV) function based on the feature model. We evaluate our methods based on extensive experiments by using a real-world trajectory dataset generated by over 12,000 taxicabs in Beijing. The results demonstrate the efficiency and effectiveness of our methods in different applications.

Keywords

Spatial databases Trajectoy Data profiling 

References

  1. 1.
    Li, X., Han, J., Lee, J.-G., Gonzalez, H.: Traffic density-based discovery of hot routes in road networks. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 441–459. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  2. 2.
    Zheng, Y., Zhang, L., Xie, X., Ma, W.-Y.: Mining interesting locations and travel sequences from GPS trajectories. In: Proceedings of the 18th International Conference on World Wide Web, pp. 791–800. ACM (2009)Google Scholar
  3. 3.
    Chen, Z., Shen, H.T., Zhou, X.: Discovering popular routes from trajectories. In: 2011 IEEE 27th International Conference on Data Engineering (ICDE), pp. 900–911. IEEE (2011)Google Scholar
  4. 4.
    Monreale, A., Pinelli, F., Trasarti, R., Giannotti, F.: Wherenext: a location predictor on trajectory pattern mining. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 637–646. ACM (2009)Google Scholar
  5. 5.
    Xue, A.Y., Zhang, R., Zheng, Y., Xie, X., Huang, J., Xu, Z.: Destination prediction by sub-trajectory synthesis and privacy protection against such prediction. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 254–265. IEEE (2013)Google Scholar
  6. 6.
    Giannotti, F., Nanni, M., Pinelli, F., Pedreschi, D.: Trajectory pattern mining. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 330–339. ACM (2007)Google Scholar
  7. 7.
    Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartographica: Int. J. Geogr. Inf. Geovis. 10(2), 112–122 (1973)CrossRefGoogle Scholar
  8. 8.
    Trajcevski, G., Cao, H., Scheuermanny, P., Wolfsonz, O., Vaccaro, D.: On-line data reduction and the quality of history in moving objects databases. In: Proceedings of the 5th ACM International Workshop on Data Engineering for Wireless and Mobile Access, pp. 19–26. ACM (2006)Google Scholar
  9. 9.
    Long, C., Wong, R.C.-W., Jagadish, H.V.: Direction-preserving trajectory simplification. Proc. VLDB Endow. 6(10), 949–960 (2013). http://dx.doi.org/10.14778/2536206.2536221 CrossRefGoogle Scholar
  10. 10.
    Lou, Y., Zhang, C., Zheng, Y., Xie, X., Wang, W., Huang, Y.: Map-matching for low-sampling-rate GPS trajectories. In Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 352–361. ACM (2009)Google Scholar
  11. 11.
    Panagiotakis, C., Pelekis, N., Kopanakis, I., Ramasso, E., Theodoridis, Y.: Segmentation and sampling of moving object trajectories based on representativeness. IEEE Trans. Knowl. Data Eng. 24(7), 1328–1343 (2012)CrossRefGoogle Scholar
  12. 12.
    Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 99–108. ACM (2010)Google Scholar
  13. 13.
    Yuan, J., Zheng, Y., Xie, X., Sun, G.: T-drive: enhancing driving directions with taxi drivers’ intelligence. IEEE Trans. Knowl. Data Eng. 25(1), 220–232 (2013)CrossRefGoogle Scholar
  14. 14.
    Lee, J.-G., Han, J., Whang, K.-Y.: Trajectory clustering: a partition-and-group framework. In: Proceedings of the 2007 ACM SIGMOD International Conference on Management of Data, pp. 593–604. ACM (2007)Google Scholar
  15. 15.
    Wei, L.-Y., Zheng, Y., Peng, W.-C.: Constructing popular routes from uncertain trajectories. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 195–203. ACM (2012)Google Scholar
  16. 16.
    Wang, Y., Zheng, Y., Xue, Y.: Travel time estimation of a path using sparse trajectories. In: Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 25–34. ACM (2014)Google Scholar
  17. 17.
    Kirkpatrick, S., Vecchi, M., et al.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Wei Jiang
    • 1
  • Jie Zhu
    • 1
  • Jiajie Xu
    • 1
    • 2
  • Zhixu Li
    • 1
    • 2
  • Pengpeng Zhao
    • 1
    • 2
  • Lei Zhao
    • 1
    • 2
    Email author
  1. 1.School of Computer Science and TechnologySoochow UniversitySuzhouChina
  2. 2.Collaborative Innovation Center of Novel Software Technology and IndustrializationNanjingChina

Personalised recommendations