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

The DOI matches its Crossref record.

Prediction of Road Traffic Congestion Based on Random Forest

Liu, Yunxiang, Wu, Hao·2017·2017 10th International Symposium on Computational Intelligence and Design (ISCID)

Abstract

With the process of urban modernization becoming faster and faster, there are more and more vehicles in the city, and the situation of urban traffic congestion is becoming more and more serious. In this paper, a model of traffic congestion prediction is constructed by using machine learning classification algorithm - random forest to construct traffic congestion state prediction model. The random forest algorithm has the characteristics of high robustness, high performance and high practicability. The weather conditions, time period, special conditions of road, road quality and holiday are used as model input variables to establish road traffic forecasting model. Finally, the results show that the traffic prediction model established by using the random forest classification algorithm has a prediction accuracy of 87.5%, and the generalization error is low, and it can be effectively predicted. Moreover, the calculation speed is fast, and it has stronger applicability to the prediction of congested condition.

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.

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

Integrity signals

Registry

Crossref · 10.1109/iscid.2017.216

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.

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

Cited by

See all 186

Metadata

Authors
Liu, Y., & Wu, H.
Venue
2017 10th International Symposium on Computational Intelligence and Design (ISCID)
Publisher
IEEE
Published
2017-12
Pages
361-364
OpenAlex
W2785818537
Cited by
186
References
0
FWCI
11.94
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: Prediction of Road Traffic Congestion Based on Random Forest. https://app.cochat.ai/papers/10.1109/iscid.2017.216
The paper
Liu, Y., & Wu, H. (2017). Prediction of Road Traffic Congestion Based on Random Forest. 2017 10th International Symposium on Computational Intelligence and Design (ISCID). https://doi.org/10.1109/iscid.2017.216

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.