Distributed Human Trajectory Sensing and Partial Similarity Queries

Advances in wireless communication technology have allowed for the collection of large-scale human motion trajectories by recording the appearance of mobile devices within the neighborhood of wireless base stations. Such city-scale datasets pose new challenges on efficient data collection, analysis and similarity based queries. In this paper, we propose new partial similarity measures, categorized as time-sensitive, order-sensitive and order-insensitive ones, and show with real data that these partial similarity measures are more robust than classical measures and more suitable for generating meaningful query results in near-neighbor type of data mining applications. Further, the power of the partial similarity persists even with significant down-sampling. We presented rigorous analysis of the performance of partial similarity measures with subsampling. Our evaluation using real data shows high recall and precision (≥ 90%) with samples only in the order of 1% of the original data size.

[1]  Jie Gao,et al.  MinHash Hierarchy for Privacy Preserving Trajectory Sensing and Query , 2017, 2017 16th ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN).

[2]  Wesley G. Jennings,et al.  “Which Group Are You In?”: A Preliminary Investigation of Group‐Based Publication Trajectories of Criminology and Criminal Justice Scholars , 2008 .

[3]  Dino Pedreschi,et al.  Human mobility, social ties, and link prediction , 2011, KDD.

[4]  César A. Hidalgo,et al.  Unique in the Crowd: The privacy bounds of human mobility , 2013, Scientific Reports.

[5]  Helmut Alt,et al.  Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..

[6]  Xiaoru Yuan,et al.  Visual Traffic Jam Analysis Based on Trajectory Data , 2013, IEEE Transactions on Visualization and Computer Graphics.

[7]  Bettina Speckmann,et al.  Computing the Fréchet distance with shortcuts is NP-hard , 2014, Symposium on Computational Geometry.

[8]  Joachim Gudmundsson,et al.  Fast Fréchet queries , 2011, Comput. Geom..

[9]  Marvin Künnemann,et al.  Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[10]  Francesco Silvestri,et al.  FRESH: Fréchet Similarity with Hashing , 2019, WADS.

[11]  Elisa Bertino,et al.  Advances in Spatial and Temporal Databases, 9th International Symposium, SSTD 2005, Angra dos Reis, Brazil, August 22-24, 2005, Proceedings , 2005, SSTD.

[12]  Helmut Alt,et al.  Comparison of Distance Measures for Planar Curves , 2003, Algorithmica.

[13]  Erin W. Chambers,et al.  Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time , 2010, Comput. Geom..

[14]  Heng Tao Shen,et al.  Convoy Queries in Spatio-Temporal Databases , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[15]  Florian Verhein Mining Complex Spatio-Temporal Sequence Patterns , 2009, SDM.

[16]  Sariel Har-Peled,et al.  Approximating the Fréchet Distance for Realistic Curves in Near Linear Time , 2010, Discrete & Computational Geometry.

[17]  Sariel Har-Peled,et al.  Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts , 2012, SIAM J. Comput..

[18]  Karl Bringmann,et al.  A fast implementation of near neighbors queries for Fréchet distance (GIS Cup) , 2017, SIGSPATIAL/GIS.

[19]  Christian S. Jensen,et al.  Discovery of convoys in trajectory databases , 2008, Proc. VLDB Endow..

[20]  Wolfgang Mulzer,et al.  Four Soviets Walk the Dog - with an Application to Alt's Conjecture , 2012, SODA.

[21]  Karl Bringmann,et al.  Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[22]  Gian Luca Foresti,et al.  Trajectory-Based Anomalous Event Detection , 2008, IEEE Transactions on Circuits and Systems for Video Technology.

[23]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[24]  Francesco Silvestri,et al.  Locality-Sensitive Hashing of Curves , 2017, Symposium on Computational Geometry.

[25]  Cyrus Shahabi,et al.  Accurate Discovery of Valid Convoys from Moving Object Trajectories , 2009, 2009 IEEE International Conference on Data Mining Workshops.

[26]  Mayank Goswami,et al.  Multi-resolution sketches and locality sensitive hashing for fast trajectory processing , 2018, SIGSPATIAL/GIS.

[27]  Kevin Buchin,et al.  Exact algorithms for partial curve matching via the Fréchet distance , 2009, SODA.

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

[29]  Yoichi Sato,et al.  Learning motion patterns and anomaly detection by Human trajectory analysis , 2007, 2007 IEEE International Conference on Systems, Man and Cybernetics.

[30]  Maike Buchin,et al.  Can We Compute the Similarity between Surfaces? , 2007, Discret. Comput. Geom..

[31]  Anne Driemel,et al.  On the complexity of range searching among curves , 2017, SODA.

[32]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[33]  Toon Calders,et al.  Towards distributed convoy pattern mining , 2015, SIGSPATIAL/GIS.

[34]  Michael Godau,et al.  A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation Algorithms , 1991, STACS.

[35]  Qingquan Li,et al.  Hierarchical route planning based on taxi GPS-trajectories , 2009, 2009 17th International Conference on Geoinformatics.

[36]  Piotr Indyk,et al.  Approximate nearest neighbors: towards removing the curse of dimensionality , 1998, STOC '98.

[37]  Haim Kaplan,et al.  The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection , 2014, Symposium on Computational Geometry.

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

[39]  Boris Aronov,et al.  Fréchet Distance for Curves, Revisited , 2006, ESA.

[40]  Piotr Indyk,et al.  Approximate nearest neighbor algorithms for Frechet distance via product metrics , 2002, SCG '02.

[41]  P. Santi,et al.  Addressing the minimum fleet problem in on-demand urban mobility , 2018, Nature.

[42]  Jie Gao,et al.  Persistence based online signal and trajectory simplification for mobile devices , 2014, SIGSPATIAL/GIS.

[43]  Dan Pei,et al.  MobiCamp: a Campus-wide Testbed for Studying Mobile Physical Activities , 2016, WPA '16.

[44]  Qingquan Li,et al.  Mining time-dependent attractive areas and movement patterns from taxi trajectory data , 2009, 2009 17th International Conference on Geoinformatics.

[45]  Jie Gao,et al.  Fighting Statistical Re-Identification in Human Trajectory Publication , 2017, SIGSPATIAL/GIS.