Real-Time Adaptive Traffic Flow Prediction Based on a GE-GRU-KNN Model
Bibliographic record
Abstract
Traffic flow prediction is an important part of urban intelligent transportation systems. However, due to strong nonlinear characteristics and spatiotemporal correlations of the traffic within the network, traffic flow prediction has been a challenging task. In order to capture the spatiotemporal correlation, and improve the traditional methods of using predefined adjacency matrices that cannot effectively characterise the dynamic correlation of traffic flow, a GE-GRU-KNN model for predicting the road traffic flow is proposed. Specifically, the spatial representation of the road network learned by GE is used to automatically extract the spatial features of the network; GRU is used to learn the nonlinear characteristics of the time series to capture the temporal correlation of the traffic flow; finally, the KNN algorithm is introduced to combine real-time traffic flow and historical data and adaptively update the fusion weights of predicted values for different road sections. The method enables the model to effectively characterise the dynamic correlation of traffic flow. An experiment using traffic flow data from 22 detectors on California freeways is conducted. The results show that compared with traditional methods, the prediction error of this method is reduced by 1.08%–14.71%, indicating that the hybrid GE-GRU-KNN model exhibits good performance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".