<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>An Efficient Spatio-Temporal Mining Approach to Really Know Who Travels with Whom!</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Pascal Poncelet</string-name>
          <email>Pascal.Poncelet@ema.fr</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>LGI2P Research Center</institution>
          ,
          <addr-line>Nimes</addr-line>
          ,
          <country country="FR">France</country>
        </aff>
      </contrib-group>
      <abstract>
        <p />
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Recent improvements in positioning technology has led to a much
wider availability of 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, in this talk 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 proposed in two versions which are GeT Move and
Incremental GeT Move. Experiments performed on real and synthetic
datasets and the experimental results will be also presented to show that
our approaches are very effective and outperform existing algorithms in
terms of efficiency. Finally we will present some future work.</p>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>