Detecting commuting patterns by clustering subtrajectories

K. Buchin, M. Buchin, J. Gudmundsson, M. Löffler, J. Luo

Research output: Contribution to journalArticleAcademicpeer-review

76 Citations (Scopus)
1 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)253-282
JournalInternational Journal of Computational Geometry and Applications
Volume21
Issue number3
DOIs
Publication statusPublished - 2011

Fingerprint Dive into the research topics of 'Detecting commuting patterns by clustering subtrajectories'. Together they form a unique fingerprint.

  • Cite this