Forecasting the Short-Term Traffic Flow in the Intelligent Transportation System Based on an Inertia Nonhomogenous Discrete Gray Model
Bibliographic record
Abstract
The traffic-flow system has basic dynamic characteristics. This feature provides a theoretical basis for constructing a reasonable and effective model for the traffic-flow system. The research on short-term traffic-flow forecasting is of wide interest. Its results can be applied directly to advanced traffic information systems and traffic management, providing real-time and effective traffic information. According to the dynamic characteristics of traffic-flow data, this paper extends the mechanical properties, such as distance, acceleration, force combination, and decomposition, to the traffic-flow data vector. According to the mechanical properties of the data, this paper proposes four new models of structural parameters and component parameters, inertia nonhomogenous discrete gray models (referred to as INDGM), and analyzes the important properties of the model. This model examines the construction of the inertia nonhomogenous discrete gray model from the mechanical properties of the data, explaining the classic NDGM modeling mechanism in the meantime. Finally, this paper analyzes the traffic-flow data of Whitemud Drive in Canada and studies the relationship between the inertia model and the traffic-flow state according to the data analysis of the traffic-flow state. A simulation accuracy and prediction accuracy of up to 0.0248 and 0.0273, respectively, are obtained.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 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".