SMoT+NCS: Algorithm for Detecting Non-Continuous Stops

Authors

  • Francisco Javier Moreno Arboleda Universidad Nacional de Colombia sede Medellín
  • Vania Bogorny Universidade Federal de Santa Catarina, Porto Alegre
  • Holver Patiño Universidad Nacional de Colombia sede Medellín

Keywords:

Trajectory stops, moving object trajectories, non-continuous stops, semantic trajectories, stops and moves

Abstract

Several algorithms have been proposed in the last years for discovering stops in trajectories of moving objects. Some methods consider as stops the subtrajectories that i) have speed lower than the average trajectory speed, ii) present significant direction changes, iii) have gaps, or iv) intersect a given spatial region. In these approaches a time constraint should be met for the subtrajectory to be considered as a stop, and this constraint is absolute (it is met or not). Indeed, these approaches consider stops as a continuous subtrajectory. In this paper, we show that for several application domains the stops do not need to be continuous, and the time constraint should be relaxed. In summary, we present the definitions of non-continuous stops and present an algorithm to discover a new kind of stops. We evaluate the proposed algorithm with a running example and real trajectory data, comparing it to the most similar approach in the literature, the SMoT algorithm.

Downloads

Download data is not yet available.

Author Biography

Francisco Javier Moreno Arboleda, Universidad Nacional de Colombia sede Medellín

Associate Teacher Dept. Computer Science, Ph.d.

Downloads

Published

2017-06-12

How to Cite

Moreno Arboleda, F. J., Bogorny, V., & Patiño, H. (2017). SMoT+NCS: Algorithm for Detecting Non-Continuous Stops. COMPUTING AND INFORMATICS, 36(2), 283–306. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/2017_2_283

Most read articles by the same author(s)