research-article

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

Authors:

Michael R. Evans,

Shashi Shekhar,

Francis HarveyAuthors Info & Claims

UrbComp '13: Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing

Article No.: 9, Pages 1 - 8

https://doi.org/10.1145/2505821.2505835

Published: 11 August 2013 Publication History

Abstract

Given a set of trajectories on a road network, the goal of the All-Pair Network Trajectory Similarity (APNTS) problem is to calculate the similarity between all trajectories using the Network Hausdorff Distance. This problem is important for a variety of societal applications, such as facilitating greener travel via bicycle corridor identification. The APNTS problem is challenging due to the high cost of computing the exact Network Hausdorff Distance between trajectories in spatial big datasets. Previous work on the APNTS problem takes over 16 hours of computation time on a real-world dataset of bicycle GPS trajectories in Minneapolis, MN. In contrast, this paper focuses on a scalable method for the APNTS problem using the idea of row-wise computation, resulting in a computation time of less than 6 minutes on the same datasets. We provide a case study for transportation services using a data-driven approach to identify primary bicycle corridors for public transportation by leveraging emerging GPS trajectory datasets.

References

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[6]

D. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, USA, 2010.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[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.

Digital Library

[22]

Yu Zheng and Xiaofang Zhou. Computing with Spatial Trajectories. Springer Publishing Company, Incorporated, 1st edition, 2011.

Digital Library

Cited By

Zhang XWang MFu W(2022)The Variation of Surface Shape in the Gas Jet FormingApplied Sciences10.3390/app1301050413:1(504)Online publication date: 30-Dec-2022
https://doi.org/10.3390/app13010504
Houssou NGuillaume JPrigent A(2022)Edit distance with Quasi Real Penalties: a hybrid distance for network-constrained trajectories2022 IEEE International Conference on Data Mining Workshops (ICDMW)10.1109/ICDMW58026.2022.00136(1045-1053)Online publication date: Nov-2022
https://doi.org/10.1109/ICDMW58026.2022.00136
Anjaria JWei HLi HMishra SSamet H(2021)TrajDistLearnProceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/3486629.3490693(1-9)Online publication date: 2-Nov-2021
https://dl.acm.org/doi/10.1145/3486629.3490693
Show More Cited By

Index Terms

Fast and exact network trajectory similarity computation: a case-study on bicycle corridor planning
1. Human-centered computing
  1. Visualization
    1. Visualization application domains
      1. Geographic visualization
2. Information systems
  1. Information systems applications
    1. Spatial-temporal systems

Recommendations

A Graph-based Approach for Trajectory Similarity Computation in Spatial Networks
KDD '21: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining

Trajectory similarity computation is an essential operation in many applications of spatial data analysis. In this paper, we study the problem of trajectory similarity computation over spatial network, where the real distances between objects are ...
Vehicle Trajectory Similarity: Models, Methods, and Applications

The increasing availability of vehicular trajectory data is at the core of smart mobility solutions. Such data offer us unprecedented information for the development of trajectory data mining-based applications. An essential task of trajectory analysis ...
Identifying K Primary Corridors from urban bicycle GPS trajectories on a road network

Given a set of GPS tracks on a road network and a number k, the K-Primary-Corridor (KPC) problem aims to identify k tracks as primary corridors such that the overall distance from all tracks to their closest primary corridors is minimized. The KPC ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

UrbComp '13: Proceedings of the 2nd ACM SIGKDD International Workshop on Urban Computing

August 2013

135 pages

ISBN:9781450323314

DOI:10.1145/2505821

General Chairs:
Steven E. Koonin
New York University
,
Ouri E. Wolfson
University of Illinois at Chicago
,
Program Chair:
Yu Zheng
Microsoft Research Asia

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 August 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

KDD' 13

Sponsor:

KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

August 11, 2013

Illinois, Chicago

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
368
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)1

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang XWang MFu W(2022)The Variation of Surface Shape in the Gas Jet FormingApplied Sciences10.3390/app1301050413:1(504)Online publication date: 30-Dec-2022
https://doi.org/10.3390/app13010504
Houssou NGuillaume JPrigent A(2022)Edit distance with Quasi Real Penalties: a hybrid distance for network-constrained trajectories2022 IEEE International Conference on Data Mining Workshops (ICDMW)10.1109/ICDMW58026.2022.00136(1045-1053)Online publication date: Nov-2022
https://doi.org/10.1109/ICDMW58026.2022.00136
Anjaria JWei HLi HMishra SSamet H(2021)TrajDistLearnProceedings of the 14th ACM SIGSPATIAL International Workshop on Computational Transportation Science10.1145/3486629.3490693(1-9)Online publication date: 2-Nov-2021
https://dl.acm.org/doi/10.1145/3486629.3490693
Shen SWei ZSun LRao KWang R(2020)A Hybrid Dispatch Strategy Based on the Demand Prediction of Shared BicyclesApplied Sciences10.3390/app1008277810:8(2778)Online publication date: 16-Apr-2020
https://doi.org/10.3390/app10082778
Koide SXiao CIshikawa Y(2020)Fast subtrajectory similarity search in road networks under weighted edit distance constraintsProceedings of the VLDB Endowment10.14778/3407790.340781813:12(2188-2201)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407818
Hsu OLee C(2020)Common Sub-Trajectory Clustering via Hypercubes in Spatiotemporal SpaceIEEE Access10.1109/ACCESS.2020.29681508(23369-23377)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.2968150
He TBao JRuan SLi RLi YHe HZheng Y(2019)Interactive Bike Lane Planning using Sharing Bikes' TrajectoriesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2019.2907091(1-1)Online publication date: 2019
https://doi.org/10.1109/TKDE.2019.2907091
Xiao PAng MJiawei ZLei W(2019)Approximate Similarity Measurements on Multi-Attributes Trajectories DataIEEE Access10.1109/ACCESS.2018.28894757(10905-10915)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2018.2889475
Kumar DWu HRajasegarar SLeckie CKrishnaswamy SPalaniswami M(2018)Fast and Scalable Big Data Trajectory Clustering for Understanding Urban MobilityIEEE Transactions on Intelligent Transportation Systems10.1109/TITS.2018.285477519:11(3709-3722)Online publication date: Nov-2018
https://doi.org/10.1109/TITS.2018.2854775
Mariescu-Istodor RFränti P(2017)Grid-Based Method for GPS Route Analysis for RetrievalACM Transactions on Spatial Algorithms and Systems10.1145/31256343:3(1-28)Online publication date: 29-Sep-2017
https://dl.acm.org/doi/10.1145/3125634
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents