A hybrid method for short-term freeway travel time prediction based on wavelet neural network and Markov chain
Bibliographic record
Abstract
Short-term travel time prediction is an essential input to intelligent transportation systems. Timely and accurate traffic forecasting is necessary for advanced traffic management systems and advanced traveler information systems. Despite several short-term travel time prediction approaches have been proposed in the past decade, especially for hybrid models that consist of machine learning models and statistical models, few studies focus on the over-fitting problem brought by hybrid models. The over-fitting problem deteriorates the prediction accuracy especially during peak hours. This paper proposes a hybrid model that embraces wavelet neural network (WNN), Markov chain (MAR), and the volatility (VOA) model for short-term travel time prediction in a freeway system. The purpose of this paper is to provide deeper insights into underlining dynamic traffic patterns and to improve the prediction accuracy and robustness. The method takes periodical analysis, error correction, and noise extraction into consideration and improve the forecasting performance in peak hours. The proposed methodology predicts travel time by decomposing travel time data into three components: a periodic trend presented by a modified WNN, a residual part modeled by Markov chain, and the volatility part estimated by the modified generalized autoregressive conditional heteroscedasticity model. Forecasting performance is investigated with freeway travel time data from Houston, Texas and examined by three measures: mean absolute error, mean absolute percentage error, and root mean square error. The results show that the travel times predicted by the WNN-MAR-VOA method are robust and accurate. Meanwhile, the proposed method is able to capture the underlying periodic characteristics and volatility nature of travel time data.
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.000 |
| 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".