Long-Term Airport Network Performance Forecasting With Linear Diffusion Graph Networks
Bibliographic record
Abstract
Precise forecasting of airport performances, such as landing rates and delays, is essential for the smooth operation of air traffic management systems and for improving the passenger experience. While current efforts predominantly address short-term predictions, the imperative for long-term forecasting is undeniable, particularly for strategic operational planning and resource management. Equally important is the explainability of these forecasts, which is critical for effective decision-making. To meet these needs, our study introduces an innovative approach to airport performance forecasting with the Linear-Diffusion Graph Network (LDGN), an explainable and probabilistic model. The LDGN is intricately structured, comprising stacked temporal linear layers and graph diffusion layers that harness the clarity of linear time series models. This configuration adeptly captures the nuanced interactions between graph-based diffusion processes and the dynamic spread of conditions across airport performances. Departing from conventional point forecasts, the LDGN produces a probabilistic output, prioritizing predictability and a strong capacity for generalization. The model’s pre-training is enhanced with stochastic mask reconstruction, a technique that significantly improves its ability to generalize. Through rigorous testing on real-world datasets, we have validated the LDGN’s superior performance in both long-term and very long-term forecasting. Our results demonstrate not only high accuracy and explainability but also a robust capacity for uncertainty quantification.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 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".