Detecting Commuting Patterns by Clustering Subtrajectories [chapter]

Kevin Buchin, Maike Buchin, Joachim Gudmundsson, Maarten Löffler, Jun Luo
2008 Lecture Notes in Computer Science  
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.
doi:10.1007/978-3-540-92182-0_57 fatcat:haqj77ranvhkhecn4ruyqljsf4