NSIM: A robust method to discover similar trajectories on cellular network location data

Trajectory analysis is crucial and has been more and more widely used in various fields, such as location-based services, urban traffic control, route plan, etc. The existing methods have certain limitations when applied to cellular network location data. In this paper, we propose NSIM, a novel approach that can effectively discover similar trajectories. In NSIM, we first design an algorithm that can discover all the common moving patterns among trajectories, and then we adopt a vectorization method to abstract each trajectory as a summary vector that composed of specific common moving patterns. Finally we measure the similarity of trajectories by computing the distance between the summary vectors. Extensive experiments on real-world dataset show that, compared with three other approaches, NSIM achieves good effectiveness in most test cases and achieves better efficiency when applied to small or medium length trajectories.

[1]  Mark Last,et al.  Incremental Clustering of Mobile Objects , 2007, 2007 IEEE 23rd International Conference on Data Engineering Workshop.

[2]  Clu-istos Foutsos,et al.  Fast subsequence matching in time-series databases , 1994, SIGMOD '94.

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

[4]  Dimitrios Gunopulos,et al.  Rotation invariant distance measures for trajectories , 2004, KDD.

[5]  Martin Ester,et al.  Spatially embedded co-offence prediction using supervised learning , 2014, KDD.

[6]  Wang-Chien Lee,et al.  Mining user similarity from semantic trajectories , 2010, LBSN '10.

[7]  Jiawei Han,et al.  BIDE: efficient mining of frequent closed sequences , 2004, Proceedings. 20th International Conference on Data Engineering.

[8]  Haixun Wang,et al.  Landmarks: a new model for similarity-based pattern querying in time series databases , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[9]  Hans-Peter Kriegel,et al.  Can Shared-Neighbor Distances Defeat the Curse of Dimensionality? , 2010, SSDBM.

[10]  Yifan Li,et al.  Clustering moving objects , 2004, KDD.

[11]  Padhraic Smyth,et al.  Trajectory clustering with mixtures of regression models , 1999, KDD '99.

[12]  Kai Zheng,et al.  Calibrating trajectory data for spatio-temporal similarity analysis , 2014, The VLDB Journal.

[13]  Deok-Hwan Kim,et al.  Similarity search for multidimensional data sequences , 2000, Proceedings of 16th International Conference on Data Engineering (Cat. No.00CB37073).

[14]  Christos Faloutsos,et al.  Efficient Similarity Search In Sequence Databases , 1993, FODO.

[15]  Dimitrios Gunopulos,et al.  Discovering similar multidimensional trajectories , 2002, Proceedings 18th International Conference on Data Engineering.

[16]  Nasser Yazdani,et al.  Matching and indexing sequences of different lengths , 1997, CIKM '97.

[17]  Markus Schneider,et al.  Similarity measurement of moving object trajectories , 2012, IWGS '12.

[18]  Richard E. Overill.  Book Review: "Time Warps, String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison" by David Sankoff and Joseph Kruskal , 2001, J. Log. Comput..