Skip to main content

Valuable Group Trajectory Pattern Mining Directed by Adaptable Value Measuring Model

  • Conference paper
  • First Online:
Web-Age Information Management (WAIM 2016)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9659))

Included in the following conference series:

  • 1124 Accesses

Abstract

Group trajectory pattern mining for large amounts of mobile customers is a practical task in broad applications. Usually the pattern mining result is a set of mined patterns with their support. However, most of them are not valuable for users and it is difficult for users to go through all mined patterns to find valuable ones. In this paper, instead of just mining group trajectory patterns, we investigate how to mine the top valuable patterns for users, which has not been well solved yet given the following two challenges. The first is how to estimate the value of trajectory patterns according to users’ requirements. Second, there are redundant information in the mined results because many mined patterns share common sub-patterns. To address these challenges, we define an adaptable value measuring model by leveraging multi-factors correlation in users’ requirements, which is used to estimate the value of trajectory patterns. In order to reduce the redundant sub-patterns, we propose a new group trajectory pattern mining approach directed by the adaptable value measuring model. In addition, we extend and implement the algorithm as a parallel algorithm in cloud computing platform to deal with massive data. Experiments on real massive mobile data show the effectiveness and efficiency of the proposed approach.

This research is supported by the Natural Science Foundation of China (Grant No. 61572043, 61300003).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Zheng, K., Zheng, Y., Yuan, N.J., Shang, S., Zhou, X.: Online discovery of gathering patterns over trajectories. IEEE Trans. Knowl. Data Eng. 26(8), 1974–1988 (2014)

    Article  Google Scholar 

  2. 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 

  3. Li, Z., Wang, J., Han, J.: Mining event periodicity from incomplete observations. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 444–452. ACM (2012)

    Google Scholar 

  4. 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 

  5. Zheng, Y.: Trajectory data mining: an overview. ACM Trans. Intell. Syst. Technol. (TIST) 6(3), 29 (2015)

    Google Scholar 

  6. Jeung, H., Yiu, M.L., Zhou, X., Jensen, C.S., Shen, H.T.: Discovery of convoys in trajectory databases. Proc. VLDB Endowment 1(1), 1068–1080 (2008)

    Article  Google Scholar 

  7. 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 

  8. Yin, Z., Cao, L., Han, J., Luo, J., Huang, T.S.: Diversified trajectory pattern ranking in geo-tagged social media. In: SDM, SIAM pp. 980–991 (2011)

    Google Scholar 

  9. Hsieh, H.P., Li, C.T., Lin, S.D.: Exploiting large-scale check-in data to recommend time-sensitive routes. In: Proceedings of the ACM SIGKDD International Workshop on Urban Computing, pp. 55–62. ACM (2012)

    Google Scholar 

  10. Pelekis, N., Kopanakis, I., Kotsifakos, E.E., Frentzos, E., Theodoridis, Y.: Clustering trajectories of moving objects in an uncertain world. In: Ninth IEEE International Conference on Data Mining, ICDM 2009, pp. 417–427. IEEE (2009)

    Google Scholar 

  11. Zheng, K., Zheng, Y., Xie, X., Zhou, X.: Reducing uncertainty of low-sampling-rate trajectories. In: 2012 IEEE 28th International Conference on Data Engineering (ICDE). pp. 1144–1155. IEEE (2012)

    Google Scholar 

  12. Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A density-based algorithm for discovering clusters in large spatial databases with noise. Kdd 96, 226–231 (1996)

    Google Scholar 

  13. Kalnis, P., Mamoulis, N., Bakiras, S.: On discovering moving clusters in spatio-temporal data. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 364–381. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shun Li .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Huang, X., Wang, T., Li, S., Chen, W. (2016). Valuable Group Trajectory Pattern Mining Directed by Adaptable Value Measuring Model. In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds) Web-Age Information Management. WAIM 2016. Lecture Notes in Computer Science(), vol 9659. Springer, Cham. https://doi.org/10.1007/978-3-319-39958-4_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-39958-4_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-39957-7

  • Online ISBN: 978-3-319-39958-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics