Recent improvements in positioning technology have led to a massive moving object data. A crucial task is to find the moving objects that travel together. Usually, they are called spatio-temporal patterns. Due to the emergence of many different kinds of spatio-temporal patterns in recent years, different approaches have been proposed to extract them. However, each approach only focuses on mining a specific kind of pattern. In addition to the fact that it is a painstaking task due to the large number of algorithms used to mine and manage patterns, it is also time consuming. Additionally, we have to execute these algorithms again whenever new data are added to the existing database. To address these issues, we first redefine spatio-temporal patterns in the itemset context. Secondly, we propose a unifying approach, named GeT-Move, using a frequent closed itemset-based spatio-temporal pattern-mining algorithm to mine and manage different spatio-temporal patterns. GeT-Move is implemented in two versions which are GeT-Move and Incremental GeT-Move. Experiments are performed on real and synthetic datasets and the results show that our approaches are very effective and outperform existing algorithms in terms of efficiency. © Springer-Verlag Berlin Heidelberg 2012.
CITATION STYLE
Nhat Hai, P., Poncelet, P., & Teisseire, M. (2012). GeT-move: An efficient and unifying spatio-temporal pattern mining algorithm for moving objects. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7619 LNCS, pp. 276–288). https://doi.org/10.1007/978-3-642-34156-4_26
Mendeley helps you to discover research relevant for your work.