Computing longest duration flocks in trajectory data
Top Cited Papers
- 10 November 2006
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in trajectories, namely flocks and meetings. The patterns are large enough subgroups of the moving point objects that exhibit similar movement and proximity for a certain amount of time. We consider the problem of computing a longest duration flock or meeting. We give several exact and approximation algorithms, and also show that some variants are as hard as MaxClique to compute and approximate.Keywords
This publication has 11 references indexed in Scilit:
- Detecting outliers from large datasetsPublished by Taylor & Francis ,2010
- Efficient Detection of Patterns in 2D Trajectories of Moving PointsGeoInformatica, 2007
- Reporting Flock PatternsLecture Notes in Computer Science, 2006
- Mining Spatio-temporal Association Rules, Sources, Sinks, Stationary Regions and Thoroughfares in Object Mobility DatabasesLecture Notes in Computer Science, 2006
- On Discovering Moving Clusters in Spatio-temporal DataLecture Notes in Computer Science, 2005
- Modeling Moving Objects over Multiple GranularitiesAnnals of Mathematics and Artificial Intelligence, 2002
- Learning spatio-temporal patterns for predicting object behaviourImage and Vision Computing, 2000
- Clique is hard to approximate within n1−εActa Mathematica, 1999
- Supporting fast search in time series for movement patterns in multiple scalesPublished by Association for Computing Machinery (ACM) ,1998
- Better lower bounds on detecting affine and spherical degeneraciesDiscrete & Computational Geometry, 1995