A combined method for short-term traffic flow prediction based on recurrent neural network
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The accurate prediction of real-time traffic flow is indispensable to intelligent transport systems. However, the short-term prediction remains a thorny issue, due to the complexity and stochasticity of the traffic flow. To solve the problem, a combined prediction method for short-term traffic flow based on the autoregressive integral moving average (ARIMA) model and long short-term memory (LSTM) neural network was proposed. The method could make short-term predictions of future traffic flow based on historical traffic data. Firstly, the linear regression feature of the traffic data was captured using the rolling regression ARIMA model; then, backpropagation was used to train the LSTM network to capture the non-linear features of the traffic data; and finally, based on the dynamic weighting of sliding window combined the predicted effects of these two techniques. Using MAE, MSE RMSE and MAPE as evaluation indicators, the prediction performance of the combined method proposed was evaluated on three real highway data sets, and compared with the three comparative baselines of ARIMA and LSTM two single methods and equal weight combination. The experimental results show that the dynamic weighted combination model proposed has better prediction effect, which proves the versatility of this method.
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
Hochreiter, S., & Schmidhuber, J. (1997) · Neural Computation · doi:10.1162/neco.1997.9.8.1735 · Cited by 102,318
Data-Driven Intelligent Transportation Systems: A Survey
Zhang, J., Wang, F.-Y., Wang, K., Lin, W.-H., Xu, X., & Chen, C. (2011) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2011.2158001 · Cited by 1,817
Cited by
A Short-Term Traffic Flow Prediction Model Based on an Improved Gate Recurrent Unit Neural Network
Shu, W., Cai, K., & Xiong, N. N. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3094659 · Cited by 262
Metadata
- Authors
- Lu, S., Zhang, Q., Chen, G., & Seng, D.
- Venue
- Alexandria Engineering Journal
- Publisher
- Elsevier BV
- Published
- 2021-02
- Volume
- 60
- Issue
- 1
- Pages
- 87-94
- ISSN
- 1110-0168 (ISSN-L)
- OpenAlex
- W3038719270
- Cited by
- 176
- References
- 2
- FWCI
- 11.97
- Type
- journal article
- Language
- en
- Open access
- gold
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.