Abstract
With the development of positioning technology, movement data has become widely available nowadays. An important task in movement data analysis is to mine the relationships among moving objects based on their spatiotemporal interactions. Among all relationship types, attraction and avoidance are arguably the most natural ones. However, rather surprisingly, there is no existing method that addresses the problem of mining significant attraction and avoidance relationships in a well-defined and unified framework. In this paper, we propose a novel method to measure the significance value of relationship between any two objects by examining the background model of their movements via permutation test. Since permutation test is computationally expensive, two effective pruning strategies are developed to reduce the computation time. Furthermore, we show how the proposed method can be extended to effeciently answer the classic threshold query: given an object, retrieve all the objects in the database that have relationships, whose significance values are above certain threshold, with the query object. Empirical studies on both synthetic data and real movement data demonstrate the effectiveness and effeciency of our method.
Original language | English (US) |
---|---|
Pages (from-to) | 157-168 |
Number of pages | 12 |
Journal | Proceedings of the VLDB Endowment |
Volume | 7 |
Issue number | 3 |
DOIs | |
State | Published - Nov 2013 |
Event | Proceedings of the 40th International Conference on Very Large Data Bases, VLDB 2014 - Hangzhou, China Duration: Sep 1 2014 → Sep 5 2014 |
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)
- General Computer Science