The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
T-drive: driving directions based on taxi trajectories
Abstract
GPS-equipped taxis can be regarded as mobile sensors probing traffic flows on road surfaces, and taxi drivers are usually experienced in finding the fastest (quickest) route to a destination based on their knowledge. In this paper, we mine smart driving directions from the historical GPS trajectories of a large number of taxis, and provide a user with the practically fastest route to a given destination at a given departure time. In our approach, we propose a time-dependent landmark graph, where a node (landmark) is a road segment frequently traversed by taxis, to model the intelligence of taxi drivers and the properties of dynamic road networks. Then, a Variance-Entropy-Based Clustering approach is devised to estimate the distribution of travel time between two landmarks in different time slots. Based on this graph, we design a two-stage routing algorithm to compute the practically fastest route. We build our system based on a real-world trajectory dataset generated by over 33,000 taxis in a period of 3 months, and evaluate the system by conducting both synthetic experiments and in-the-field evaluations. As a result, 60-70% of the routes suggested by our method are faster than the competing methods, and 20% of the routes share the same results. On average, 50% of our routes are at least 20% faster than the competing approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Fayyad, U. M., & Irani, K. B. (1993) · International Joint Conference on Artificial Intelligence · Cited by 2,870
Understanding mobility based on GPS data
Zheng, Y., Li, Q., Chen, Y., Xie, X., & Ma, W.-Y. (2008) · Proceedings of the 10th international conference on Ubiquitous computing · doi:10.1145/1409635.1409677 · Cited by 1,132
Self-citationAn Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Map-matching for low-sampling-rate GPS trajectories
Lou, Y., Zhang, C., Zheng, Y., Xie, X., Wang, W., & Huang, Y. (2009) · Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/1653771.1653820 · Cited by 797
Self-citationLearning transportation mode from raw gps data for geographic applications on the web
Zheng, Y., Liu, L., Wang, L., & Xie, X. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367532 · Cited by 616
Self-citationThe Inverse Gaussian Distribution: Theory, Methodology, and Applications.
Ahsanullah, M., Chhikara, R. S., & Folks, J. L. (1990) · Journal of the American Statistical Association · doi:10.2307/2290048 · Cited by 582
Understanding transportation modes based on GPS data for web applications
Zheng, Y., Chen, Y., Li, Q., Xie, X., & Ma, W.-Y. (2010) · ACM Transactions on the Web · doi:10.1145/1658373.1658374 · Cited by 484
Self-citationShortest-path and minimum-delay algorithms in networks with time-dependent edge-length
Orda, A., & Rom, R. (1990) · Journal of the ACM · doi:10.1145/79147.214078 · Cited by 483
Predestination: Inferring Destinations from Partial Trajectories
Krumm, J., & Horvitz, E. (2006) · Lecture Notes in Computer Science · doi:10.1007/11853565_15 · Cited by 458
The shortest route through a network with time-dependent internodal transit times
Cooke, K. L., & Halsey, E. (1966) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(66)90009-6 · Cited by 412
An Interactive-Voting Based Map Matching Algorithm
Yuan, J., Zheng, Y., Zhang, C., Xie, X., & Sun, G.-Z. (2010) · 2010 Eleventh International Conference on Mobile Data Management · doi:10.1109/mdm.2010.14 · Cited by 318
Self-citationNavigate like a cabbie: probabilistic reasoning from observed context-aware behavior
Ziebart, B. D., Maas, A. L., Dey, A. K., & Bagnell, J. A. (2008) · Proceedings of the 10th international conference on Ubiquitous computing · doi:10.1145/1409635.1409678 · Cited by 270
Adaptive fastest path computation on a road network: a traffic mining approach
González, H., Han, J., Li, X., Myslinska, M., & Sondag, J. P. (2007) · Very Large Data Bases · Cited by 263
Finding Fastest Paths on A Road Network with Speed Patterns
Kanoulas, E., Du, Y., Xia, T., & Zhang, D. (2006) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2006.71 · Cited by 254
Continuous-Time Dynamic Shortest Path Algorithms
Dean, B. C. (1999) · Cited by 61
Cited by
Urban Computing: Concepts, Methodologies, and Applications
Zheng, Y., Capra, L., Wolfson, O., & Yang, H. (2014) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2629592 · Cited by 1,507
Self-citationGraph neural network for traffic forecasting: A survey
Jiang, W., & Luo, J. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2022.117921 · Cited by 1,316
Driving with knowledge from the physical world
Yuan, J., Zheng, Y., Xie, X., & Sun, G. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020462 · Cited by 849
Self-citationMap-matching for low-sampling-rate GPS trajectories
Lou, Y., Zhang, C., Zheng, Y., Xie, X., Wang, W., & Huang, Y. (2009) · Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/1653771.1653820 · Cited by 797
Self-citationPredicting Taxi–Passenger Demand Using Streaming Data
Moreira-Matias, L., Gama, J., Ferreira, M., Mendes-Moreira, J., & Damas, L. (2013) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2013.2262376 · Cited by 721
Metadata
- Authors
- Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., & Huang, Y.
- Venue
- Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
- Publisher
- ACM
- Published
- 2010-11-02
- Pages
- 99-108
- OpenAlex
- W2031674781
- Cited by
- 1,105
- References
- 15
- FWCI
- 48.53
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.