Trajectory Pattern Mining with Multistage Spatial Partitioning

Most trajectory pattern mining techniques assume that the data to be analyzed contain complete and evenly distributed spatial and temporal information. However in reality, collected data may contain noise, missing or incomplete information, and uneven spatial resolution. In trajectory pattern mining methods, trajectory patterns are extracted by splitting spatial workspace into uniformly tiny sized squares, followed by determining popular cells which contain many data points. Finally, a sequential pattern mining technique, e.g. MiSTA, is used to extract trajectory pattern. This research proposes non-uniform partitioning to handle uneven spatial distribution as modification towards the uniform spatial workspace division process. The proposed approach, named multistage spatial partitioning is developed based on point-region quadtree concept. The new partitioning method is conducted for preprocessing before applying MiSTA. As the result, using multistage spatial partition, MiSTA succeeds in uncovering more detailed and broader coverage patterns compared to uniform partitioning approach through a series of experiments.

[1]  Jae-Gil Lee,et al.  Trajectory clustering: a partition-and-group framework , 2007, SIGMOD '07.

[2]  Moshe E. Ben-Akiva,et al.  Estimation and Prediction of Time-Dependent Origin-Destination Flows with a Stochastic Mapping to Path Flows and Link Flows , 2002, Transp. Sci..

[3]  Anthony J. T. Lee,et al.  Mining frequent trajectory patterns in spatial-temporal databases , 2009, Inf. Sci..

[5]  Sanjay Chawla,et al.  Mining Spatio-temporal Association Rules, Sources, Sinks, Stationary Regions and Thoroughfares in Object Mobility Databases , 2006, DASFAA.

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

[7]  Zhenhui Li.  Spatiotemporal Pattern Mining: Algorithms and Applications , 2014, Frequent Pattern Mining.

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

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

[10]  Tetsuya Iizuka,et al.  Mining sequential patterns including time intervals , 2000, SPIE Defense + Commercial Sensing.

[11]  George Kollios,et al.  Mining, indexing, and querying historical spatiotemporal data , 2004, KDD.

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

[13]  Heng Tao Shen,et al.  Mining Trajectory Patterns Using Hidden Markov Models , 2007, DaWaK.

[14]  Panos Kalnis,et al.  On Discovering Moving Clusters in Spatio-temporal Data , 2005, SSTD.

[15]  Hwan-Seung Yong,et al.  Mining Spatio-Temporal Patterns in Trajectory Data , 2010, J. Inf. Process. Syst..

[16]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[17]  Marie-Odile Cordier,et al.  An Inductive Database for Mining Temporal Patterns in Event Sequences , 2005, IJCAI.

[18]  Hanan Samet,et al.  Using Quadtrees to Represent Spatial Data , 1985 .

[19]  Nikos Mamoulis,et al.  Discovery of Collocation Episodes in Spatiotemporal Data , 2006, Sixth International Conference on Data Mining (ICDM'06).