Mining, indexing, and querying historical spatiotemporal data
- 22 August 2004
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 236-245
- https://doi.org/10.1145/1014052.1014080
Abstract
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. For example, people wake up at the same time and follow more or less the same route to their work everyday. The discovery of hidden periodic patterns in spatiotemporal data, apart from unveiling important information to the data analyst, can facilitate data management substantially. Based on this observation, we propose a framework that analyzes, manages, and queries object movements that follow such patterns. We define the spatiotemporal periodic pattern mining problem and propose an effective and fast mining algorithm for retrieving maximal periodic patterns. We also devise a novel, specialized index structure that can benefit from the discovered patterns to support more efficient execution of spatiotemporal queries. We evaluate our methods experimentally using datasets with object trajectories that exhibit periodicity.Keywords
This publication has 5 references indexed in Scilit:
- Developing data allocation schemes by incremental mining of user moving patterns in a mobile computing systemIEEE Transactions on Knowledge and Data Engineering, 2003
- SPADE: An Efficient Algorithm for Mining Frequent SequencesMachine Learning, 2001
- Mining asynchronous periodic patterns in time series dataPublished by Association for Computing Machinery (ACM) ,2000
- Comparison of access methods for time-evolving dataACM Computing Surveys, 1999
- R-treesPublished by Association for Computing Machinery (ACM) ,1984