In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Fréchet distance and the discrete Fréchet distance between subtrajectories, which are invariant under differences in speed. We give several approximation algorithms, and also show that the problem of finding the 'longest' subtrajectory cluster is as hard as MaxClique to compute and approximate.
|Journal||International Journal of Computational Geometry and Applications|
|Publication status||Published - 2011|
Buchin, K., Buchin, M., Gudmundsson, J., Löffler, M., & Luo, J. (2011). Detecting commuting patterns by clustering subtrajectories. International Journal of Computational Geometry and Applications, 21(3), 253-282. https://doi.org/10.1142/S0218195911003652