Mining Frequent Spatial-Textual Sequence Patterns

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 naive external-memory algorithm that uses random partitioning.

[1]  Shamkant B. Navathe,et al.  An Efficient Algorithm for Mining Association Rules in Large Databases , 1995, VLDB.

[2]  Nicholas Jing Yuan,et al.  Towards efficient search for activity trajectories , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[3]  Keun Ho Ryu,et al.  Temporal Pattern Mining of Moving Objects for Location-Based Service , 2002, DEXA.

[4]  Umeshwar Dayal,et al.  FreeSpan: frequent pattern-projected sequential pattern mining , 2000, KDD '00.

[5]  Derya Birant,et al.  ST-DBSCAN: An algorithm for clustering spatial-temporal data , 2007, Data Knowl. Eng..

[6]  Qiming Chen,et al.  PrefixSpan,: mining sequential patterns efficiently by prefix-projected pattern growth , 2001, Proceedings 17th International Conference on Data Engineering.

[7]  Dino Pedreschi,et al.  Trajectory pattern mining , 2007, KDD '07.

[8]  Vikram Goyal,et al.  Efficient Enforcement of Privacy for Moving Object Trajectories , 2013, ICISS.

[9]  Dino Pedreschi,et al.  Mining sequences with temporal annotations , 2006, SAC '06.

[10]  Dimitrios Gunopulos,et al.  Efficient Mining of Spatiotemporal Patterns , 2001, SSTD.

[11]  Ee-Peng Lim,et al.  Mining Mobile Group Patterns: A Trajectory-Based Approach , 2005, PAKDD.

[12]  Nikos Mamoulis,et al.  Mining frequent spatio-temporal sequential patterns , 2005, Fifth IEEE International Conference on Data Mining (ICDM'05).

[13]  Jiawei Han,et al.  Discovery of Spatial Association Rules in Geographic Information Databases , 1995, SSD.

[14]  Jean-François Boulicaut,et al.  GO-SPADE: Mining Sequential Patterns over Datasets with Consecutive Repetitions , 2003, MLDM.

[15]  Ramakrishnan Srikant,et al.  Mining sequential patterns , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[16]  Shamkant B. Navathe,et al.  A ranking measure for top-k moving object trajectories search , 2013, GIR '13.

[17]  Ling Liu,et al.  Efficient Trajectory Cover Search for Moving Object Trajectories , 2013 .

[18]  Ramakrishnan Srikant,et al.  Mining Sequential Patterns: Generalizations and Performance Improvements , 1996, EDBT.

[19]  Mohammed J. Zaki,et al.  SPADE: An Efficient Algorithm for Mining Frequent Sequences , 2004, Machine Learning.

[20]  Suh-Yin Lee,et al.  Fast Discovery of Sequential Patterns through Memory Indexing and Database Partitioning , 2005, J. Inf. Sci. Eng..

[21]  Johannes Gehrke,et al.  Sequential PAttern mining using a bitmap representation , 2002, KDD.