An Improved CEEMDAN-FE-TCN Model for Highway Traffic Flow Prediction
Bibliographic record
Abstract
With the advent of the data-driven era, deep learning approaches have been gradually introduced to short-term traffic flow prediction, which plays a vital role in the Intelligent Transportation System (ITS). A hybrid predicting model based on deep learning is proposed in this paper, including three steps. Firstly, an improved Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (CEEMDAN) method is applied to decompose the nonlinear time series of highway traffic flow to obtain the intrinsic mode function (IMF). The fuzzy entropy (FE) is then calculated to recombine subsequences, highlighting traffic flow dynamics in different frequencies and improving prediction efficiency. Finally, the Temporal Convolutional Network (TCN) is adopted to predict the recombined subsequences, and the final prediction result is reconstructed. Two sensors of US101-S on the main road and on-ramp were selected to measure the prediction effect. The results show that the prediction error of the proposed model on two sensors is notably decreased on single-step and multistep prediction, compared with the original TCN model. Furthermore, the proposed improved CEEMDAN-FE-X framework can be combined with prevailing prediction methods to increase the prediction accuracy, among which the improved CEEMDAN-FE-TCN model has the best performance and strong robustness.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 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".