TY - GEN
T1 - GeT-move
T2 - 11th International Symposium on Intelligent Data Analysis, IDA 2012
AU - Nhat Hai, Phan
AU - Poncelet, Pascal
AU - Teisseire, Maguelonne
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
KW - Spatio-temporal pattern
KW - frequent closed itemset
KW - trajectories
UR - http://www.scopus.com/inward/record.url?scp=84868032357&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84868032357&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-34156-4_26
DO - 10.1007/978-3-642-34156-4_26
M3 - Conference contribution
AN - SCOPUS:84868032357
SN - 9783642341557
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 276
EP - 288
BT - Advances in Intelligent Data Analysis XI - 11th International Symposium, IDA 2012, Proceedings
Y2 - 25 October 2012 through 27 October 2012
ER -