Deep Learning Based Traffic Flow Prediction for Autonomous Vehicular Mobile Networks
Bibliographic record
Abstract
Accurate traffic flow prediction plays a crucial role in designing Ad hoc vehicular mobile networks in modern Internet of things (IoT) based intelligent systems. Several deep learning techniques have been deployed to predict traffic conditions to make vehicular communication more reliable. However, not all these approaches deal with complex road networks and spatial temporal dependencies of traffic data. In this paper, we analyze this problem using long short-term memory (LSTM), gated recurrent unit (GRU) and hybrid CNN-LSTM models. We trained our models using actual traffic flow data provided by the California Department of Transportation (Caltrans) over a 6 month duration and showed that our deep learning models outperform the traditional linear regression method. Moreover, an architectural study of deep learning models is carried out for the traffic flow prediction problem. The performance of these models is evaluated using MSE and MAE metrics. It is observed that the GRU model is the best to handle the complex vehicular traffic mechanisms. Also, that a complex hybrid model like CNN-LSTM does not always outperform the much simpler architectures such as LSTM and GRU.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".