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.
This research was initiated during the GADGET Workshop on Geometric Algorithms and Spatial Data Mining, funded by the Netherlands Organisation for Scientific Research (NWO) under BRICKS/FOCUS grant number 642.065.503. The research was further supported by NWO through the GADGET and GOGO projects, and by the Australian Government’s Backing Australia’s Ability initiative, in part through the Australian Research Council.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Internat. J. Comput. Geom. Appl. 5, 75–91 (1995)
Andersson, M., Gudmundsson, J., Laube, P., Wolle, T.: Reporting leadership patterns among trajectories. GeoInformatica 12(4), 497–528 (2008)
Buchin, K., Buchin, M., Gudmundsson, J.: Detecting single file movement. In: Proc. 16th ACM SIGSPATIAL Internat. Conf. Advances in Geographic Information Systems (to appear, 2008)
Buchin, K., Buchin, M., Gudmundsson, J., Löffler, M., Luo, J.: Detecting commuting patterns by clustering subtrajectories. Tech. Rep. UU-CS-2008-029, Utrecht University (2008)
Buchin, K., Buchin, M., Wang, Y.: Exact algorithm for partial curve matching via the Fréchet distance. In: Proc. 20th ACM-SIAM Symp. Discrete Algorithms (to appear, 2009)
Cao, H., Wolfson, O., Trajcevski, G.: Spatio-temporal data reduction with deterministic error bounds. The VLDB Journal 15(3), 211–228 (2006)
Dumitrescu, A., Rote, G.: On the Fréchet distance of a set of curves. In: Proc. 16th Canad. Conf. Comput. Geom. pp. 162–165 (2004)
Eiter, T., Mannila, H.: Computing discrete Fréchet distance. Tech. Rep. CD-TR 94/64, Information Systems Department, Technical University of Vienna (1994)
Frank, A.U.: Socio-economic units: Their life and motion. In: Frank, A.U., Raper, J., Cheylan, J.P. (eds.) Life and motion of socio-economic units, GISDATA, vol. 8, pp. 21–34. Taylor & Francis, London (2001)
Gaffney, S., Robertson, A., Smyth, P., Camargo, S., Ghil, M.: Probabilistic clustering of extratropical cyclones using regression mixture models. Climate Dynamics 29(4), 423–440 (2007)
Gaffney, S., Smyth, P.: Trajectory clustering with mixtures of regression models. In: Proc. 5th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining, pp. 63–72 (1999)
Gudmundsson, J., Katajainen, J., Merrick, D., Ong, C., Wolle, T.: Compressing spatio-temporal trajectories. In: Proc. 18th Internat. Symp. Algorithms and Computation, pp. 763–775 (2007)
Gudmundsson, J., Laube, P., Wolle, T.: Movement Patterns in Spatio-Temporal Data. In: Encyclopedia of GIS, pp. 726–732. Springer, Heidelberg (2008)
Güting, R.H., Schneider, M.: Moving Objects Databases. Morgan Kaufmann Publishers, San Francisco (2005)
Hadjieleftheriou, M., Kollios, G., Tsotras, V.J., Gunopulos, D.: Indexing spatio-temporal archives. The VLDB Journal 15(2), 143–164 (2006)
Laube, P., van Kreveld, M., Imfeld, S.: Finding REMO – detecting relative motion patterns in geospatial lifelines. In: Proc. 11th Internat Symp. Spatial Data Handling, pp. 201–214 (2004)
Mamoulis, N., Cao, H., Kollios, G., Hadjieleftheriou, M., Tao, Y., Cheung, D.: Mining, indexing, and querying historical spatiotemporal data. In: Proc. 10th Internat Conf. Knowledge Discovery and Data Mining, pp. 236–245 (2004)
Sâltenis, S., Jensen, C.S., Leutenegger, S.T., Lopez, M.A.: Indexing the positions of continuously moving objects. In: Proc. ACM SIGMOD Internat Conf. Management of Data, pp. 331–342 (2000)
Vlachos, M., Gunopulos, D., Kollios, G.: Discovering similar multidimensional trajectories. In: Proc. 18th Internat Conf. Data Engineering, pp. 673–684 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buchin, K., Buchin, M., Gudmundsson, J., Löffler, M., Luo, J. (2008). Detecting Commuting Patterns by Clustering Subtrajectories . In: Hong, SH., Nagamochi, H., Fukunaga, T. (eds) Algorithms and Computation. ISAAC 2008. Lecture Notes in Computer Science, vol 5369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92182-0_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-92182-0_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92181-3
Online ISBN: 978-3-540-92182-0
eBook Packages: Computer ScienceComputer Science (R0)