A framework of traveling companion discovery on trajectory data streams

The advance of mobile technologies leads to huge volumes of spatio-temporal data collected in the form of trajectory data streams. In this study, we investigate the problem of discovering object groups that travel together (i.e., traveling companions) from trajectory data streams. Such technique has broad applications in the areas of scientific study, transportation management, and military surveillance. To discover traveling companions, the monitoring system should cluster the objects of each snapshot and intersect the clustering results to retrieve moving-together objects. Since both clustering and intersection steps involve high computational overhead, the key issue of companion discovery is to improve the efficiency of algorithms. We propose the models of closed companion candidates and smart intersection to accelerate data processing. A data structure termed traveling buddy is designed to facilitate scalable and flexible companion discovery from trajectory streams. The traveling buddies are microgroups of objects that are tightly bound together. By only storing the object relationships rather than their spatial coordinates, the buddies can be dynamically maintained along the trajectory stream with low cost. Based on traveling buddies, the system can discover companions without accessing the object details. In addition, we extend the proposed framework to discover companions on more complicated scenarios with spatial and temporal constraints, such as on the road network and battlefield. The proposed methods are evaluated with extensive experiments on both real and synthetic datasets. Experimental results show that our proposed buddy-based approach is an order of magnitude faster than the baselines and achieves higher accuracy in companion discovery.

[1]  Raymond Chi-Wing Wong,et al.  Finding shortest path on land surface , 2011, SIGMOD '11.

[2]  Elisa Bertino,et al.  Continuous Intersection Joins Over Moving Objects , 2008, 2008 IEEE 24th International Conference on Data Engineering.

[3]  Lars Kulik,et al.  Analysis and evaluation of V*-kNN: an efficient algorithm for moving kNN queries , 2010, The VLDB Journal.

[4]  Philip S. Yu,et al.  Mining Colossal Frequent Patterns by Core Pattern Fusion , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[5]  Jian Pei,et al.  On k-skip shortest paths , 2011, SIGMOD '11.

[6]  Cyrus Shahabi,et al.  Indexing land surface for efficient kNN query , 2008, Proc. VLDB Endow..

[7]  Eric Horvitz,et al.  Prediction, Expectation, and Surprise: Methods, Designs, and Study of a Deployed Traffic Forecasting Service , 2005, UAI.

[8]  Joachim Gudmundsson,et al.  Reporting flock patterns , 2006, Comput. Geom..

[9]  Marios Hadjieleftheriou,et al.  Time relaxed spatiotemporal trajectory joins , 2005, GIS '05.

[10]  Yunhao Liu,et al.  Mining Frequent Trajectory Patterns for Activity Monitoring Using Radio Frequency Tag Arrays , 2012, IEEE Transactions on Parallel and Distributed Systems.

[11]  Christos Faloutsos,et al.  Efficient retrieval of similar time sequences under time warping , 1998, Proceedings 14th International Conference on Data Engineering.

[12]  Sangkyum Kim,et al.  Tru-Alarm: Trustworthiness Analysis of Sensor Networks in Cyber-Physical Systems , 2010, 2010 IEEE International Conference on Data Mining.

[13]  Yu Zheng,et al.  Computing with Spatial Trajectories , 2011, Computing with Spatial Trajectories.

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

[15]  Jae-Gil Lee,et al.  Traffic Density-Based Discovery of Hot Routes in Road Networks , 2007, SSTD.

[16]  Hai Yang,et al.  ACM Transactions on Intelligent Systems and Technology - Special Section on Urban Computing , 2014 .

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

[18]  Jian Pei,et al.  Data Mining: Concepts and Techniques, 3rd edition , 2006 .

[19]  Matthew O. Ward,et al.  Neighbor-based pattern detection for windows over streaming data , 2009, EDBT '09.

[20]  Xuemin Lin,et al.  Clustering Moving Objects for Spatio-temporal Selectivity Estimation , 2004, ADC.

[21]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[22]  Sariel Har-Peled.  Clustering Motion , 2004, Discret. Comput. Geom..

[23]  Padhraic Smyth,et al.  A general probabilistic framework for clustering individuals and objects , 2000, KDD '00.

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

[25]  Beng Chin Ooi,et al.  Continuous Clustering of Moving Objects , 2007, IEEE Transactions on Knowledge and Data Engineering.

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

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

[28]  Jiawei Han,et al.  Swarm: Mining Relaxed Temporal Moving Object Clusters , 2010, Proc. VLDB Endow..

[29]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[30]  Jing Yuan,et al.  On Discovery of Traveling Companions from Streaming Trajectories , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[31]  Shashi Shekhar,et al.  A partial join approach for mining co-location patterns , 2004, GIS '04.

[32]  Bettina Speckmann,et al.  Efficient detection of motion patterns in spatio-temporal data sets , 2004, GIS '04.

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

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

[35]  Cyrus Shahabi,et al.  Continuous Monitoring of Nearest Neighbors on Land Surface , 2009, Proc. VLDB Endow..

[36]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[37]  Lars Kulik,et al.  The V*-Diagram: a query-dependent approach to moving KNN queries , 2008, Proc. VLDB Endow..

[38]  Hans-Peter Kriegel,et al.  A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , 1996, KDD.

[39]  Xing Xie,et al.  Retrieving k-Nearest Neighboring Trajectories by a Set of Point Locations , 2011, SSTD.

[40]  Guangzhong Sun,et al.  Driving with knowledge from the physical world , 2011, KDD.

[41]  Raymond Chi-Wing Wong,et al.  A highly optimized algorithm for continuous intersection join queries over moving objects , 2011, The VLDB Journal.

[42]  Xing Xie,et al.  Reducing Uncertainty of Low-Sampling-Rate Trajectories , 2012, 2012 IEEE 28th International Conference on Data Engineering.

[43]  Jeffrey Considine,et al.  Spatio-temporal aggregation using sketches , 2004, Proceedings. 20th International Conference on Data Engineering.

[44]  Ji Hyea Han,et al.  Data Mining : Concepts and Techniques 2 nd Edition Solution Manual , 2005 .

[45]  Xing Xie,et al.  T-drive: driving directions based on taxi trajectories , 2010, GIS '10.

[46]  Mong-Li Lee,et al.  Supporting Frequent Updates in R-Trees: A Bottom-Up Approach , 2003, VLDB.

[47]  Cyrus Shahabi,et al.  Scalable shortest paths browsing on land surface , 2010, GIS '10.

[48]  Xing Xie,et al.  GeoLife: A Collaborative Social Networking Service among User, Location and Trajectory , 2010, IEEE Data Eng. Bull..

[49]  Jiawei Han,et al.  Data Mining: Concepts and Techniques, Second Edition , 2006, The Morgan Kaufmann series in data management systems.

[50]  Joachim Gudmundsson,et al.  Computing longest duration flocks in trajectory data , 2006, GIS '06.

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

[52]  Hans-Peter Kriegel,et al.  Incremental Clustering for Mining in a Data Warehousing Environment , 1998, VLDB.