Network-level traffic flow prediction: Functional time series vs. functional neural network approach
Bibliographic record
Abstract
Traffic state prediction is an essential component and an underlying backbone of intelligent transportation systems, especially in the context of smart city framework. Its significance is mainly twofold in modern transportation systems: supporting advanced traffic operations and management for highways and urban road networks to mitigate traffic congestion and enabling individual drivers with connected vehicles in the traffic system to dynamically optimize their routes to improve travel time. Traffic state prediction with interval-based pointwise methods at 15-minute or hourly intervals is common in traffic literature. However, because traffic dynamics are a continuous process over time, the discrete-time pointwise methods for traffic prediction at a fixed time interval hardly meet the advanced demands of continuous prediction in modern transportation systems. To close the gap, we propose functional approaches to intraday and day-by-day continuous-time prediction for traffic volume. This research focuses on network-level traffic flow predictions concurrently for all locations of interest. Two functional approaches are introduced, namely, the network-integrated functional time-series model and the functional neural network model. With functional approaches a 24-hour intraday traffic profile is modeled as a functional curve over time, and sequences of historical traffic curves are used to predict traffic curves for near future days in a row and multiple locations of interest. We also include the functional varying coefficient model, Sparse VAR and traditional AR models in the comparative study; empirical results show that the network-integrated functional time-series model outperforms other approaches in terms of the accuracy of predictions at network-scale.
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.002 | 0.004 |
| 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.002 |
| 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".