The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A gradient boosting method to improve travel time prediction
Abstract
Tree based ensemble methods have reached a celebrity status in prediction field. By combining simple regression trees with ‘poor’ performance, they usually produce high prediction accuracy. In contrast to other machine learning methods that have been treated as black-boxes, tree based ensemble methods provide interpretable results, while requiring little data preprocessing, are able to handle different types of predictor variables, and can fit complex nonlinear relationship. These properties make the tree based ensemble methods good candidates for solving travel time prediction problems. However, applications of tree-based ensemble algorithms in traffic prediction area are limited. In this paper, we employ a gradient boosting regression tree method (GBM) to analyze and model freeway travel time to improve the prediction accuracy and model interpretability. The gradient boosting tree method strategically combines additional trees by correcting mistakes made by its previous base models, therefore, potentially improves prediction accuracy. Different parameters’ effect on model performance and correlations of input–output variables are discussed in details by using travel time data provided by INRIX along two freeway sections in Maryland. The proposed method is, then, compared with another popular ensemble method and a bench mark model. Study results indicate that the GBM model has its considerable advantages in freeway travel time prediction.
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
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
The Strength of Weak Learnability
Schapire, R. E. (1990) · Machine Learning · doi:10.1007/bf00116037 · Cited by 4,600
Gradient boosting machines, a tutorial
Natekin, A., & Knoll, A. (2013) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2013.00021 · Cited by 3,887
Cited by
Ding, C., Cao, X. (., & Næss, P. (2018) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2018.02.009 · Cited by 446
Road Traffic Forecasting: Recent Advances and New Challenges
Lana, I., Del Ser, J., Velez, M., & Vlahogianni, E. I. (2018) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2018.2806634 · Cited by 367
Travel time prediction with LSTM neural network
Duan, Y., L.V., Y., & Wang, F.-Y. (2016) · 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc.2016.7795686 · Cited by 336
Understanding ridesplitting behavior of on-demand ride services: An ensemble learning approach
Chen, X. (., Zahiri, M., & Zhang, S. (2017) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.12.018 · Cited by 252
What the future holds: Machine learning to predict success in psychotherapy
Taubitz, F.-S., Büdenbender, B., & Alpers, G. W. (2022) · Behaviour Research and Therapy · doi:10.1016/j.brat.2022.104116 · Cited by 25
Metadata
- Authors
- Zhang, Y., & Haghani, A.
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2015-09
- Volume
- 58
- Pages
- 308-324
- ISSN
- 0968-090X (ISSN-L)
- OpenAlex
- W2106100548
- Cited by
- 832
- References
- 6
- FWCI
- 31.11
- Type
- journal article
- 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: A gradient boosting method to improve travel time prediction. https://app.cochat.ai/papers/10.1016/j.trc.2015.02.019
- The paper
- Zhang, Y., & Haghani, A. (2015). A gradient boosting method to improve travel time prediction. Transportation Research Part C: Emerging Technologies. https://doi.org/10.1016/j.trc.2015.02.019
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.