Detecting Commuting Patterns by Clustering Subtrajectories

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 Frechet distance and the discrete Frechet 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 Article (peer-reviewed)

Conference Proceedings (peer-reviewed)

Technical Report (not reviewed)

back to list