Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 222

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Day-ahead traffic flow forecasting based on a deep belief network optimized by the multi-objective particle swarm algorithm

Li, Linchao, Qin, Lingqiao, Qu, Xu, Zhang, Jian, Wang, Yonggang, Ran, Bin · 2019 · Knowledge-Based Systems

Abstract

Abstract Traffic flow forecasting is a necessary part in the intelligent transportation systems in supporting dynamic and proactive traffic control and making traffic management plan. However, most of the previous studies attempting to build traffic flow forecasting models focus on short-term forecasting as the next step. In this paper, a deep feature leaning approach is proposed to predict short-term traffic flow in the following multiple steps using supervised learning techniques. To achieve traffic flow forecasting for the next day, an advanced multi-objective particle swarm optimization algorithm is applied to optimize some parameters in deep belief networks. The modified model can boost the accuracy of the forecasting results and enhance its multiple step prediction ability. Using real-time and historical temporal–spatial traffic data, day-ahead prediction experiment is implemented. The results of the hybrid model are compared with several commonly used benchmark models and some improved deep neural network based on evaluation criteria. Also, the proposed optimization algorithm is compared with the traditional particle swarm optimization algorithm. Furthermore, the significance in the number of hidden layers is analyzed. When the layers are increasing more than 4, the performance of the proposed model stops improving significantly. The results indicate the proposed model can extract complex features of traffic flow and therefore the forecasting accuracy and stability can be effectively improved.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.knosys.2019.01.015

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Cited by

See all 222

Metadata

Authors
Li, L., Qin, L., Qu, X., Zhang, J., Wang, Y., & Ran, B.
Venue
Knowledge-Based Systems
Publisher
Elsevier BV
Published
2019-05
Volume
172
Pages
1-14
ISSN
0950-7051 (ISSN-L)
OpenAlex
W2914619357
Cited by
222
References
3
FWCI
21.69
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: Day-ahead traffic flow forecasting based on a deep belief network optimized by the multi-objective particle swarm algorithm. https://app.cochat.ai/papers/10.1016/j.knosys.2019.01.015
The paper
Li, L., Qin, L., Qu, X., Zhang, J., Wang, Y., & Ran, B. (2019). Day-ahead traffic flow forecasting based on a deep belief network optimized by the multi-objective particle swarm algorithm. Knowledge-Based Systems. https://doi.org/10.1016/j.knosys.2019.01.015

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.