The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Travel time estimation of a path using sparse trajectories
Abstract
In this paper, we propose a citywide and real-time model for estimating the travel time of any path (represented as a sequence of connected road segments) in real time in a city, based on the GPS trajectories of vehicles received in current time slots and over a period of history as well as map data sources. Though this is a strategically important task in many traffic monitoring and routing systems, the problem has not been well solved yet given the following three challenges. The first is the data sparsity problem, i.e., many road segments may not be traveled by any GPS-equipped vehicles in present time slot. In most cases, we cannot find a trajectory exactly traversing a query path either. Second, for the fragment of a path with trajectories, they are multiple ways of using (or combining) the trajectories to estimate the corresponding travel time. Finding an optimal combination is a challenging problem, subject to a tradeoff between the length of a path and the number of trajectories traversing the path (i.e., support). Third, we need to instantly answer users' queries which may occur in any part of a given city. This calls for an efficient, scalable and effective solution that can enable a citywide and real-time travel time estimation. To address these challenges, we model different drivers' travel times on different road segments in different time slots with a three dimension tensor. Combined with geospatial, temporal and historical contexts learned from trajectories and map data, we fill in the tensor's missing values through a context-aware tensor decomposition approach. We then devise and prove an object function to model the aforementioned tradeoff, with which we find the most optimal concatenation of trajectories for an estimate through a dynamic programming solution. In addition, we propose using frequent trajectory patterns (mined from historical trajectories) to scale down the candidates of concatenation and a suffix-tree-based index to manage the trajectories received in the present time slot. We evaluate our method based on extensive experiments, using GPS trajectories generated by more than 32,000 taxis over a period of two months. The results demonstrate the effectiveness, efficiency and scalability of our method beyond baseline approaches.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Mining frequent patterns without candidate generation
Han, J., Pei, J., & Yin, Y. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335372 · Cited by 6,402
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-citationTravel-Time Prediction With Support Vector Regression
Wu, C.-H., Ho, J.-M., & Lee, D. T. (2004) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2004.837813 · Cited by 1,444
T-drive: driving directions based on taxi trajectories
Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., & Huang, Y. (2010) · Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems · doi:10.1145/1869790.1869807 · Cited by 1,105
Self-citationIntelligent Transportation Systems
Dimitrakopoulos, G., & Demestichas, P. (2010) · IEEE Vehicular Technology Magazine · doi:10.1109/mvt.2009.935537 · Cited by 1,055
CarTel: a distributed mobile sensor computing system
Hull, B., Bychkovsky, V., Zhang, Y., Chen, K., Goraczko, M., Miu, A., Shih, E., Balakrishnan, H., & Madden, S. (2006) · Proceedings of the 4th international conference on Embedded networked sensor systems · doi:10.1145/1182807.1182821 · Cited by 1,030
Karatzoglou, A., Amatriain, X., Baltrunas, L., & Oliver, N. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864727 · Cited by 721
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-citationT-share: A large-scale dynamic taxi ridesharing service
Ma, S., Zheng, Y., & Wolfson, O. (2013) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.2013.6544843 · Cited by 475
Self-citation
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-citationLearning k for kNN Classification
Zhang, S., Li, X., Zong, M., Zhu, X., & Cheng, D. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2990508 · Cited by 576
Ridesourcing systems: A framework and review
Wang, H., & Yang, H. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.07.009 · Cited by 538
Methodologies for Cross-Domain Data Fusion: An Overview
Zheng, Y. (2015) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2015.2465959 · Cited by 454
Self-citationA Survey of Traffic Prediction: from Spatio-Temporal Data to Intelligent Transportation
Yuan, H., & Li, G. (2021) · Data Science and Engineering · doi:10.1007/s41019-020-00151-z · Cited by 389
Metadata
- Authors
- Wang, Y., Zheng, Y., & Xue, Y.
- Venue
- Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2014-08-24
- Pages
- 25-34
- OpenAlex
- W2144475703
- Cited by
- 525
- References
- 19
- FWCI
- 99.07
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Travel time estimation of a path using sparse trajectories. https://app.cochat.ai/papers/10.1145/2623330.2623656
- The paper
- Wang, Y., Zheng, Y., & Xue, Y. (2014). Travel time estimation of a path using sparse trajectories. Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining. https://doi.org/10.1145/2623330.2623656
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.