Discovering Similar Multidimensional Trajectories
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Mining, indexing, and querying historical spatiotemporal data
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Computing longest duration flocks in trajectory data
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
Reporting leadership patterns among trajectories
Proceedings of the 2007 ACM symposium on Applied computing
Dimensionality reduction for long duration and complex spatio-temporal queries
Proceedings of the 2007 ACM symposium on Applied computing
Trajectory clustering: a partition-and-group framework
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
Computational Geometry: Theory and Applications
Detecting Regular Visit Patterns
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
| Hi-index | 0.00 |
We are given a trajectory T and an area A. T might intersect A several times, and our aim is to detect whether T visits A with some regularity, e.g. what is the longest time span that a GPS-GSM equipped elephant visited a specific lake on a daily (weekly or yearly) basis, where the elephant has to visit the lake most of the days (weeks or years), but not necessarily on every day (week or year). We call this a regular pattern with period of one day (week or year, respectively). We consider the most general version of the problem defined in [8], the case where we are not given the period length of the regular pattern but have to find the longest regular pattern over all possible period lengths. We give an exact algorithm with O(n3.5 log3 n) running time and an approximate algorithm with O(1/εn3 log2 n) running time. We also consider the problem of finding a region that is visited regularly if one is not given. We give exact and approximate algorithms for this problem when the period length is fixed.