GeT_Move: An Efficient and Unifying Spatio-temporal Pattern Mining Algorithm for Moving Objects

• Published in: Advances in Intelligent Data Analysis XI Vol. 7619; pp. 276 - 288
• Main Authors: Nhat Hai, Phan, Poncelet, Pascal, Teisseire, Maguelonne
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2012
• Series: Lecture Notes in Computer Science
• Subjects: Computer Science; frequent closed itemset; Spatio-temporal pattern; trajectories; Frequent closed itemset; Trajectories; Spatio-temporal pattern
• ISBN: 9783642341557; 3642341551
• ISSN: 0302-9743; 1611-3349; 1611-3349
• DOI: 10.1007/978-3-642-34156-4_26

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.