出版社：The Japanese Society for Artificial Intelligence
摘要：In trajectory data mining which discovers frequent movement patterns from the trajectories of moving objects, both mining complex patterns and processing massive trajectory data are challenging problems. In this paper, we propose a new approach to trajectory data mining focusing on these problems. In order to make trajectories easier to process, traditional approaches quantize trajectories by a grid with a constant resolution. However, the optimal resolution often varies across different areas. This makes it difficult to mine complex patterns. Furthermore, the necessary amount of computational resources increases as the resolution becomes higher. This causes another problem that processing a massive dataset is difficult. To solve these problems, we propose a parallelized approach based on quadtree search with hierarchical grids. We employ a hierarchical grid structure with multiple resolutions to quantize trajectories. This approach initially searches for frequent patterns in a coarse grid level and drills down into a finer grid level to find more fine-grained patterns when needed. In this approach, we extract frequent movements as a pattern in terms of time duration of movements within a margin of error. Since an optimal time error varies across grid's resolutions, we propose a method for estimating optimal time errors. We also show a parallelization method based on MapReduce. In drilling down patterns, we mine child patterns in each region the parent pattern passes through and integrate child patterns along their parent pattern. In evaluation, experiments on real-word data show the effectiveness of our approach in mining complex patterns in low computational resources.
关键词：trajectory mining ; spatio-temporal data mining ; mapreduce
