Effective Online Group Discovery in Trajectory Databases

• Published in: IEEE transactions on knowledge and data engineering Vol. 25; no. 12; pp. 2752 - 2766
• Main Authors: Xiaohui Li, Ceikute, Vaida, Jensen, Christian S., Kian-Lee Tan
• Format: Journal Article
• Language: English
• Published: IEEE 01.12.2013
• Subjects: Approximation algorithms; Approximation methods; Clustering algorithms; Database systems; Moving objects; Time domain analysis; Trajectory; travel patterns
• ISSN: 1041-4347; 1558-2191
• DOI: 10.1109/TKDE.2012.193

GPS-enabled devices are pervasive nowadays. Finding movement patterns in trajectory data stream is gaining in importance. We propose a group discovery framework that aims to efficiently support the online discovery of moving objects that travel together. The framework adopts a sampling-independent approach that makes no assumptions about when positions are sampled, gives no special importance to sampling points, and naturally supports the use of approximate trajectories. The framework's algorithms exploit state-of-the-art, density-based clustering (DBScan) to identify groups. The groups are scored based on their cardinality and duration, and the top-k groups are returned. To avoid returning similar subgroups in a result, notions of domination and similarity are introduced that enable the pruning of low-interest groups. Empirical studies on real and synthetic data sets offer insight into the effectiveness and efficiency of the proposed framework.