Detecting commuting patterns by clustering subtrajectories

International Journal of Computational Geometry and Applications

Volumn 21, Issue 3, 2011, Pages 253-282

  Buchin, Kevin ^a   Buchin, Maike ^a   Gudmundsson, Joachim ^b   LÖffler, Maarten ^c   Luo, Jun ^d  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CSIRO   (Australia)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d SHENZHEN INSTITUTES OF ADVANCED TECHNOLOGY   (China)

Author keywords

algorithms; Fr chet distance; Trajectories

Indexed keywords

EID: 79959879608     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195911003652     Document Type: Conference Paper

References (46)

1. P. K. Agarwal, M. de Berg, J. Matousek and O. Schwarzkopf, Constructing levels in arrangements and higher order Voronoi diagrams, Proc. 10th Ann. ACM Symp. Computational Geomemetry (SoCG), (1994), pp. 67-75.
2. R. Agrawal, K.-I. Lin, H. S. Sawhney and K. Shim, Fast similarity search in the presence of noise, scaling, and translation in time-series databases, Proc. 21st Int. Conf. Very Large Data Bases (VLDB), (1995), pp. 490-501.
3. G. Al-Naymat, S. Chawla and J. Gudmundsson, Dimensionality reduction for long duration and complex spatio-temporal queries, Proc. 22nd ACM Symp. Applied Computing, (2007), pp. 393-397. (Pubitemid 47568321)
4. H. Alt and M. Godau, Computing the Fréchet distance between two polygonal curves, Int. J. Computational Geometry and Applications 5 (1995) 75-91.
5. H. Alt and L. Guibas, Discrete geometric shapes: Matching, interpolation, and approximation, Handbook of Computational Geometry, eds. J.-R. Sack and J. Urrutia (Elsevier, 1999), pp. 121-153.
6. H. Alt, C. Knauer and C. Wenk, Comparison of distance measures for planar curves, Algorithmica 38 (2) (2004) 45-58.
7. M. Andersson, J. Gudmundsson, P. Laube and T. Wolle, Reporting leadership patterns among trajectories, GeoInformatica 12 (4) (2008) 497-528.
8. M. Benkert, B. Djordjevic, J. Gudmundsson and T. Wolle, Finding popular places, Proc. 18th Int. Symp. Algorithms and Computation (ISAAC) (2007).
9. M. Benkert, J. Gudmundsson, F. Hübner and T. Wolle, Reporting flock patterns, Comput. Geom. - Th. Appl. 41 (3) (2008) 11-125.
10. K. Buchin, M. Buchin and J. Gudmundsson, Detecting single file movement, Proc. 16th ACM Int. Conf. Advances in Geographic Information Systems, (2008), pp. 288-297.
11. K. Buchin, M. Buchin, C. Knauer, G. Rote and C. Wenk, How difficult is it to walk the dog? Proc. 23rd European Workshop on Computational Geometry, (2007), pp. 170-173.
12. K. Buchin, M. Buchin and Y. Wang, Exact algorithm for partial curve matching via the Fréchet distance, Proc. 20th ACM-SIAM Symp. Discrete Algorithms (SODA) (2009).
13. H. Cao, O. Wolfson and G. Trajcevski, Spatio-temporal data reduction with deterministic error bounds, The VLDB J. 15 (3) (2006) 211-228. (Pubitemid 43938994)
14. T. Chan, On levels in arrangements of curves, III: further improvements, Proc. 24th ACM Symp. Computational Geometry (SoCG), (2008), pp. 85-93.
15. A. F. Cook IV and C. Wenk, Geodesic Fréchet distance inside a simple polygon, Proc. 25th Ann. Symp. Theoretical Aspects of Computer Science (STACS), (2008), pp. 193-204.
16. A. Dumitrescu and G. Rote, On the Fréchet distance of a set of curves, Proc. 16th Canadian Conf. Computational Geometry (CCCG), (2004), pp. 162-165.
17. T. Eiter and H. Mannila, Computing discrete Fréchet distance, Tech. Report CD-TR 94/64, Information Systems Department, Technical University of Vienna, 1994.
18. J. Erickson and R. Seidel, Better lower bounds on detecting affine and spherical degeneracies, Discr. Comput. Geom. 13 (1995) 41-57.
19. D. Eu, E. Guévremont and G. T. Toussaint, On envelopes of arrangements of lines, J. Algorithms 21 (1) (1996) 111-148. (Pubitemid 126411845)
20. A. U. Frank, Socio-economic units: Their life and motion, Life and Motion of Socio-Economic Units, eds. A. U. Frank, J. Raper and J. P. Cheylan, GISDATA, Vol. 8 (Taylor & Francis, London, 2001), pp. 21-34.
21. S. Gaffney, A. Robertson, P. Smyth, S. Camargo and M. Ghil, Probabilistic clustering of extratropical cyclones using regression mixture models, Climate Dyn. 29 (4) (2007) 423-440. (Pubitemid 47022891)
22. S. Gaffney and P. Smyth, Trajectory clustering with mixtures of regression models, Proc. 5th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, (1999), pp. 63-72.
23. 2) problems in computational geometry, Comput. Geom. - Th. Appl. 5 (1995) 165-185.
24. M. R. Garey and D. S. Johnson, Computers and Intractability (W. H. Freeman, 1979).
25. J. Gudmundsson, J. Katajainen, D. Merrick, C. Ong and T. Wolle, Compressing spatio-temporal trajectories, Proc. 18th Int. Symp. Algorithms and Computation (ISAAC) (2007).
26. J. Gudmundsson and M. J. van Kreveld, Computing longest duration flocks in trajectory data, Proc. 14th ACM Symp. Geographic Information Systems, (2006), pp. 35-42. (Pubitemid 47168529)
27. J. Gudmundsson, P. Laube and T. Wolle, Movement patterns in spatio-temporal data, Encyclopedia of GIS (Springer, 2008), pp. 726-732.
28. R. H. Güting and M. Schneider, Moving Objects Databases (Morgan Kaufmann Publishers, 2005).
29. 1-ε, ACTA Mathematica 182 (1999) 105-142.
30. M. Hadjieleftheriou, G. Kollios, V. J. Tsotras and D. Gunopulos, Indexing spatiotemporal archives, The VLDB J. 15 (2) (2006) 143-164. (Pubitemid 43938936)
31. H. Jeung, M. L. Yiu, X. Zhou, C. S. Jensen and H. T. Shen, Discovery of convoys in trajectory databases, Proc. 34th Int. Conf. Very Large Data Bases 1 (1) (2008) 1068-1080.
32. P. Kalnis, N. Mamoulis and S. Bakiras, On discovering moving clusters in spatiotemporal data, Proc. 9th Int. Symp. Advances in Spatial and Temporal Databases, LNCS, Vol. 3633 (Springer, 2005), pp. 364-381. (Pubitemid 41433175)
33. K. Kalpakis, D. Gada and V. Puttagunta, Distance measures for effective clustering of arima timeseries, Proc. 1st IEEE Int. Conf. Data Mining (ICDM), (2001), pp. 273-280.
34. M. Keil, A simple algorithm for determining the envelope of a set of lines, Source Inform. Process. Lett. 39 (3) (1991) 121-124. (Pubitemid 21722060)
35. P. Laube, S. Imfeld and R. Weibel, Discovering relative motion patterns in groups of moving point objects, Int. J. Geograph. Inform. Sci. 19 (6) (2005) 639-668. (Pubitemid 40924019)
36. P. Laube, M. van Kreveld and S. Imfeld, Finding REMO - detecting relative motion patterns in geospatial lifelines, Developments in Spatial Data Handling: Proc. 11th Int. Symp. Spatial Data Handling, (2004), pp. 201-214.
37. J.-G. Lee, J. Han and K.-Y. Whang, Trajectory clustering: A partition-andgroup framework, Proc. ACM SIGMOD Int. Conf. Management of Data, (2007), pp. 593-604.
38. N. Mamoulis, H. Cao, G. Kollios, M. Hadjieleftheriou, Y. Tao and D. Cheung, Mining, indexing, and querying historical spatiotemporal data, Proc. 10th ACM SIGKDD Int. Conf. Knowledge Discovery and Data Mining, (2004), pp. 236-245. (Pubitemid 40114933)
39. M. Nanni and D. Pedreschi, Time-focused density-based clustering of trajectories of moving objects, J. Intell. Inform. Syst. 27 (3) (2006) 267-289. (Pubitemid 44825944)
40. S. Sâltenis, C. S. Jensen, S. T. Leutenegger and M. A. Lopez, Indexing the positions of continuously moving objects, Proc. ACM SIGMOD Int. Conf. Management of Data, (2000), pp. 331-342.
41. M. Sharir, On k-sets in arrangements of curves and surfaces, Discr. Comput. Geom. 6 (1991) 593-613.
42. R. C. Veltkamp and M. Hagedoorn, State-of-the-art in shape matching, Principles of Visual Information Retrieval, ed. M. Lew (Springer, 2001), pp. 87-119.
43. F. Verhein and S. Chawla, Mining spatio-temporal association rules, sources, sinks, stationary regions and thoroughfares in object mobility databases, Proc. 11th Int. Conf. Database Systems for Advanced Applications (DASFAA), LNCS, Vol. 3882 (Springer, 2006), pp. 187-201. (Pubitemid 43978642)
44. M. Vlachos, D. Gunopulos and G. Kollios, Discovering similar multidimensional trajectories, Proc. 18th Int. Conf. Data Engineering (ICDE), (2002), pp. 673-684. (Pubitemid 34278779)
45. Wildlife tracking projects with GPS GSM collars. www.environmental- studies.de/projects/projects.html, 2007.
46. U. Wilensky, NetLogo (and NetLogo User Manual). http://ccl.northwestern. edu/netlogo, 1999.