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.

Keywords

Cite this article

@article{cai-1130,
  author  = {Francisco Moreno and Andres Pineda and Renato Fileto and Vania Bogorny},
  title   = {SMoT+: Extending the SMoT Algorithm for Discovering Stops in Nested Sites},
  journal = {Computing and Informatics},
  volume  = {33},
  number  = {2},
  pages   = {327--342},
  year    = {2014},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2014/2/smot-extending-the-smot-algorithm-for-discovering-stops-in-nested-sites/}
}
Download .bib