SMoT+: Extending the SMoT Algorithm for Discovering Stops in Nested Sites

Authors

  • Francisco Javier Moreno Departamento de Ciencias de la Computación y de la Decisión, Universidad Nacional de Colombia, Sede Medellín
  • Andrés Felipe Pineda Departamento de Ciencias de la Computación y de la Decisión, Universidad Nacional de Colombia, Sede Medellín
  • Renato Fileto Departamento de Informatica e Estatística, Universidade Federal de Santa Catarina (UFSC)
  • Vania Bogorny Departamento de Informatica e Estatística, Universidade Federal de Santa Catarina (UFSC)

Keywords:

Trajectories of moving objects, stops and moves, semantic trajectories, nested sites, trajectory episodes in different spatial granularities

Abstract

Several methods have been proposed to analyse trajectory data. However, a few of these methods consider trajectory relations with relevant features of the geographic space. One of the best-known methods that take into account the geographical regions crossed by a trajectory is the SMoT algorithm. Nevertheless, SMoT considers only disjoint geographic regions that a trajectory may traverse, while many regions of interest are contained in other regions. In this article, we extend the SMoT algorithm for discovering stops in nested regions. The proposed algorithm, called SMoT+, takes advantage of information about the hierarchy of nested regions to efficiently discover the stops in regions at different levels of this hierarchy. Experiments with real data show that SMoT+ detects stops in nested regions, which are not detected by the original SMoT algorithm, with minor growth of processing time.

Downloads

Download data is not yet available.

Downloads

Published

2014-06-27

How to Cite

Moreno, F. J., Pineda, A. F., Fileto, R., & Bogorny, V. (2014). SMoT+: Extending the SMoT Algorithm for Discovering Stops in Nested Sites. COMPUTING AND INFORMATICS, 33(2), 327–342. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/1130

Most read articles by the same author(s)