Skip to main content

Mining Frequent Spatial-Textual Sequence Patterns

  • Conference paper
  • First Online:
Book cover Database Systems for Advanced Applications (DASFAA 2015)

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

Included in the following conference series:

Abstract

Penetration of GPS-enabled devices has resulted in the generation of a lot of Spatial-Textual data, which can be mined or analyzed to improve various location-based services. One such kind of data is Spatial-Textual sequential data (Activity-Trajectory data), i.e. a sequence of locations visited by a user with each location having a set of activities performed by the user is a Spatial-Textual sequence. Mining such data for knowledge discovery is a cumbersome task due to the complexity of the data type and its representation. In this paper, we propose a mining framework along with algorithms for mining Spatial-Textual sequence data to find out frequent Spatial-Textual sequence patterns. We study the use of existing sequence mining algorithms in the context of Spatial-Textual sequence data and propose efficient algorithms which outperform existing algorithms in terms of computation time, as we observed by extensive experimentation. We also design an external memory algorithm to mine large-size data which cannot be accommodated in main memory. The external memory algorithm uses spatial dimension to partition the data into a set of chunks to minimize the number of false positives and has been shown to outperform the naïve external-memory algorithm that uses random partitioning.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, R., Srikant, R.: Mining sequential patterns. In: IEEE Eleventh International Conference on Data Engineering (ICDE), pp. 3–14 (1995)

    Google Scholar 

  2. Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 429–435. ACM (2002)

    Google Scholar 

  3. Birant, D., Kut, A.: St-dbscan: An algorithm for clustering spatial-temporal data. Data & Knowledge Engineering 60(1), 208–221 (2007)

    Article  Google Scholar 

  4. Cao, H., Mamoulis, N., Cheung, D.W.: Mining frequent spatio-temporal sequential patterns. In: Fifth IEEE International Conference on Data Mining, pp. 82–89 (2005)

    Google Scholar 

  5. Du Chung, J., Paek, O.H., Lee, J.W., Ryu, K.H.: Temporal Pattern Mining of Moving Objects for Location-Based Service. In: Hameurlain, A., Cicchetti, R., Traunmüller, R. (eds.) DEXA 2002. LNCS, vol. 2453, pp. 331–340. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Fournier-Viger, P., G.A.S.A.L.H.G.T.: SPMF: Open-Source Data Mining Platform. http://www.philippe-fournier-viger.com/spmf/ (2014)

  7. Giannotti, F., Nanni, M., Pedreschi, D., Pinelli, F.: Mining sequences with temporal annotations. In: Proceedings of the 2006 ACM Symposium on Applied Computing, pp. 593–597. ACM (2006)

    Google Scholar 

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

  9. Goyal, V., Likhyani, A., Bansal, N., Liu, L.: Efficient trajectory cover search for moving object trajectories. In: Proceedings of the 2013 IEEE Second International Conference on Mobile Services, pp. 31–38 (2013)

    Google Scholar 

  10. Goyal, V., Navathe, S.B.: A ranking measure for top-k moving object trajectories search. In: Proceedings of the 7th Workshop on Geographic Information Retrieval, pp. 27–34 (2013)

    Google Scholar 

  11. Han, J., Pei, J., Mortazavi-Asl, B., Chen, Q., Dayal, U., Hsu, M.C.: Freespan: frequent pattern-projected sequential pattern mining. In: Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 355–359. ACM (2000)

    Google Scholar 

  12. Hwang, S.-Y., Liu, Y.-H., Chiu, J.-K., Lim, E.: Mining Mobile Group Patterns: A Trajectory-Based Approach. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 713–718. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Koperski, K., Han, J.: Discovery of spatial association rules in geographic information databases. In: Advances in Spatial Databases, pp. 47–66. Springer (1995)

    Google Scholar 

  14. Leleu, M., Rigotti, C., Boulicaut, J.F., Euvrard, G.: Go-spade: mining sequential patterns over datasets with consecutive repetitions. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNAI, vol. 2734, pp. 293–306. Springer, Heidelberg 2003

    Google Scholar 

  15. Lin, M.Y., Lee, S.Y.: Fast discovery of sequential patterns through memory indexing and database partitioning. J. Inf. Sci. Eng. 21(1), 109–128 (2005)

    Google Scholar 

  16. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: Prefixspan: Mining sequential patterns efficiently by prefix-projected pattern growth. In: 29th IEEE International Conference on Data Engineering (ICDE), pp. 215–224. IEEE Computer Society (2001)

    Google Scholar 

  17. Savasere, A., Omiecinski, E.R., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: VLDB, pp. 432–444 (1995)

    Google Scholar 

  18. Saxena, A.S., Goyal, V., Bera, D.: Efficient Enforcement of Privacy for Moving Object Trajectories. In: Bagchi, A., Ray, I. (eds.) ICISS 2013. LNCS, vol. 8303, pp. 360–374. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  19. Srikant, R., Agrawal, R.: Mining sequential patterns: Generalizations and performance improvements. In: Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology, EDBT 1996, pp. 3–17 (1996)

    Google Scholar 

  20. Tsoukatos, I., Gunopulos, D.: Efficient Mining of Spatiotemporal Patterns. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 425–442. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  21. Zaki, M.J.: Spade: An efficient algorithm for mining frequent sequences. Machine Learning 42(1–2), 31–60 (2001)

    Article  MATH  Google Scholar 

  22. Zheng, K., Shang, S., Yuan, N., Yang, Y.: Towards efficient search for activity trajectories. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 230–241, April 2013

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vikram Goyal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Arya, K.K., Goyal, V., Navathe, S.B., Prasad, S. (2015). Mining Frequent Spatial-Textual Sequence Patterns. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9050. Springer, Cham. https://doi.org/10.1007/978-3-319-18123-3_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18123-3_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18122-6

  • Online ISBN: 978-3-319-18123-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics