Combined Prediction Method of Short-Term Distance Headway Based on EB-GRA-TCN
Bibliographic record
Abstract
As an essential parameter to represent vehicle following characteristics, distance headway (DHW) plays an essential role in microtraffic flow simulation, traffic control, and traffic safety alarm. However, due to the randomness, nonlinearity, and correlation of DHW data, constructing DHW prediction models is difficult. Moreover, few studies have considered the time correlation between the historical DHW and the target DHW. To solve the above problems, a DHW prediction model is proposed in this paper by integrating entropy-based grey relation analysis (EB-GRA) and temporal convolutional network (TCN), named as EB-GRA-TCN model. In the model, the EB-GRA is adopted to calculate the correlation between the target DHW and historical DHW sequences, and the DHW data with high correlation are dynamically selected as the optimal input of the DHW prediction model. Then, the TCN algorithm is used to train the DHW prediction model. The TCN architecture integrates the advantages of recurrent neural network (RNN) and convolutional neural network (CNN), which could fully use the previous DHW information. In the experiment, the DHW data from Hefei Expressway are utilized for training the EB-GRA-TCN model. The prediction results showed that the average root mean square error (RMSE) and mean absolute error (MAE) of the proposed model were 0.115 and 0.090, respectively, in the 5, 10, and 15 predicted steps. Compared with the autoregressive integrated moving average (ARIMA), TCN, RNN, and long short-term memory (LSTM) models, the EB-GRA-TCN model achieved the best prediction accuracy. The results indicated that the EB-GRA-TCN model obtained good predictive performance and could provide support for road traffic control and traffic safety warming.
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.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".