The DOI matches its Crossref record.
Short-term traffic volume forecasting: A k-nearest neighbor approach enhanced by constrained linearly sewing principle component algorithm
Open accessAbstract
To enhance the performance of the k-nearest neighbors approach in forecasting short-term traffic volume, this paper proposed and tested a two-step approach with the ability of forecasting multiple steps. In selecting k-nearest neighbors, a time constraint window is introduced, and then local minima of the distances between the state vectors are ranked to avoid overlappings among candidates. Moreover, to control extreme values’ undesirable impact, a novel algorithm with attractive analytical features is developed based on the principle component. The enhanced KNN method has been evaluated using the field data, and our comparison analysis shows that it outperformed the competing algorithms in most cases.
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
Cited by
GMAN: A Graph Multi-Attention Network for Traffic Prediction
Zheng, C., Fan, X., Wang, C., & Qi, J. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i01.5477 · Cited by 1,730
Machine Learning-based traffic prediction models for Intelligent Transportation Systems
Boukerche, A., & Wang, J. (2020) · Computer Networks · doi:10.1016/j.comnet.2020.107530 · Cited by 317
Short-Term Traffic Flow Prediction Based on Graph Convolutional Networks and Federated Learning
Xia, M., Jin, D., & Chen, J. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3179391 · Cited by 142
Metadata
- Authors
- Zheng, Z., & Su, D.
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2014-06
- Volume
- 43
- Pages
- 143-157
- ISSN
- 0968-090X (ISSN-L)
- OpenAlex
- W2075407851
- Cited by
- 188
- References
- 0
- FWCI
- 18.63
- Type
- journal article
- Language
- en
- Open access
- green
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: Short-term traffic volume forecasting: A k-nearest neighbor approach enhanced by constrained linearly sewing principle component algorithm. https://app.cochat.ai/papers/10.1016/j.trc.2014.02.009
- The paper
- Zheng, Z., & Su, D. (2014). Short-term traffic volume forecasting: A k-nearest neighbor approach enhanced by constrained linearly sewing principle component algorithm. Transportation Research Part C: Emerging Technologies. https://doi.org/10.1016/j.trc.2014.02.009
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.