Fast and exact network trajectory similarity computation: A case-study on bicycle corridor planning

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2013, Pages

  Evans, Michael R ^a   Oliver, Dev ^a   Shekhar, Shashi ^a   Harvey, Francis ^b  

^a University of Minnesota   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

network hausdorff distance; spatial data mining; trajectory similarity

Indexed keywords

COMPUTATION TIME; DATA-DRIVEN APPROACH; GPS TRAJECTORIES; HAUSDORFF DISTANCE; PUBLIC TRANSPORTATION; SPATIAL DATA MINING; TRAJECTORY SIMILARITIES; TRANSPORTATION SERVICES;

BICYCLES; GEOMETRY; SCALABILITY;

TRAJECTORIES;

EID: 84884160987     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2505821.2505835     Document Type: Conference Paper

References (22)

1. Helmut Alt and Leonidas J Guibas. Discrete geometric shapes: Matching, interpolation, and approximation. Handbook of computational geometry, 1:121-153, 1999.
2. Hu Cao and Ouri Wolfson. Nonmaterialized motion information in transport networks. Database Theory-ICDT 2005, pages 173-188, 2005.
3. Jinyang Chen, Rangding Wang, Liangxu Liu, and Jiatao Song. Clustering of trajectories based on hausdorff distance. In Electronics, Communications and Control (ICECC), 2011 International Conference on, pages 1940-1944. IEEE, 2011.
4. T.H. Cormen. Introduction to algorithms. The MIT press, 2001.
5. Michael R. Evans, Dev Oliver, Shashi Shekhar, and Francis Harvey. Summarizing trajectories into k-primary corridors: a summary of results. In Proceedings of the 20th International Conference on Advances in Geographic Information Systems, SIGSPATIAL '12, pages 454-457, New York, NY, USA, 2012. ACM.
6. D. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, USA, 2010.
7. Ralf Hartmut Güting, Victor Teixeira De Almeida, and Zhiming Ding. Modeling and querying moving objects in networks. The VLDB Journal, 15(2):165-190, 2006.
8. F.J. Harvey and K.J. Krizek. Commuter Bicyclist Behavior and Facility Disruption. Technical Report Report no. MnDOT 2007-15, University of Minnesota, 2007.
9. Jeff Henrikson. Completeness and total boundedness of the hausdorff metric. MIT Undergraduate Journal of Mathematics, 1:69-79, 1999.
10. Daniel P Huttenlocher and Klara Kedem. Computing the minimum hausdorff distance for point sets under translation. In Proceedings of the sixth annual symposium on Computational geometry, pages 340-349. ACM, 1990.
11. Daniel P Huttenlocher, Klara Kedem, and Jon M Kleinberg. On dynamic voronoi diagrams and the minimum hausdorff distance for point sets under euclidean motion in the plane. In Proceedings of the eighth annual symposium on Computational geometry, pages 110-119. ACM, 1992.
12. Jung-Rae Hwang, Hye-Young Kang, and Ki-Joune Li. Spatio-temporal similarity analysis between trajectories on road networks. In Proceedings of the 24th international conference on Perspectives in Conceptual Modeling, ER'05, pages 280-289, Berlin, Heidelberg, 2005. Springer-Verlag.
13. Jung-Rae Hwang, Hye-Young Kang, and Ki-Joune Li. Searching for similar trajectories on road networks using spatio-temporal similarity. In Advances in Databases and Information Systems, pages 282-295. Springer, 2006.
14. Josephine Marcotty. Federal Funding for Bike Routes Pays Off in Twin Cities. http://www.startribune.com/local/minneapolis/150105625.html.
15. Sarana Nutanong, Edwin H Jacox, and Hanan Samet. An incremental hausdorff distance calculation algorithm. Proceedings of the VLDB Endowment, 4(8):506-517, 2011.
16. G.P. Roh and S. Hwang. Nncluster: An efficient clustering algorithm for road network trajectories. In Database Systems for Advanced Applications, pages 47-61. Springer, 2010.
17. Günter Rote. Computing the minimum hausdorff distance between two point sets on a line under translation. Information Processing Letters, 38(3):123-127, 1991. (Pubitemid 21668256)
18. E. Tiakas, A. N. Papadopoulos, A. Nanopoulos, Y. Manolopoulos, Dragan Stojanovic, and Slobodanka Djordjevic-Kajan. Searching for similar trajectories in spatial networks. J. Syst. Softw., 82(5):772-788, May 2009.
19. Eleftherios Tiakas, Apostolos N Papadopoulos, Alexandros Nanopoulos, Yannis Manolopoulos, Dragan Stojanovic, and Slobodanka Djordjevic-Kajan. Trajectory similarity search in spatial networks. In IDEAS'06. 10th International, pages 185-192. IEEE, 2006.
20. Yalin Wang, Qilong Han, and Haiwei Pan. A clustering scheme for trajectories in road networks. In Advanced Technology in Teaching-Proceedings of the 2009 3rd International Conference on Teaching and Computational Science (WTCS 2009), pages 11-18. Springer, 2012.
21. Hongbin Zhao, Qilong Han, Haiwei Pan, and Guisheng Yin. Spatio-temporal similarity measure for trajectories on road networks. In Internet Computing for Science and Engineering, Fourth International Conference on, pages 189-193. IEEE, 2009.
22. Yu Zheng and Xiaofang Zhou. Computing with Spatial Trajectories. Springer Publishing Company, Incorporated, 1st edition, 2011.