Air Pollution Forecasting Using Machine Learning with Temporal Fusion Transformer and Graph Neural Networks
Bibliographic record
Abstract
Air pollution is a significant obstacle to achieving urban sustainability and public health, particularly in rapidly developing regions. Accurate air quality prediction is essential for proactive pollution management and policy formulation. In this study, we employ sophisticated machine learning frameworks, such as Temporal Fusion Transformer (TFT) and Graph Neural Networks (GNNs), to predict air quality levels. TFT is designed to capture temporal dependencies, making it ideal for time-series forecasting, while GNNs model spatial relationships, enabling the analysis of pollutant dispersion across monitoring stations. A synthetic dataset comprising 50 rows was generated, simulating pollutant concentrations (PM2.5, PM10, CO, NO2, SO2) and meteorological variables (temperature, humidity, wind speed). The models were assessed using criteria like$R^{2}$, RMSE, and MAE. TFT achieved an$R^{2}$of 0.97 and an RMSE of$4.2 \mu ~\mathrm{g} / \mathrm{m}^3$, significantly outperforming traditional models like Random Forest and XGBoost. GNN provided spatial insights, identifying pollutant hotspots and their dispersion patterns. This research highlights the superior accuracy and scalability of TFT and GNN for air quality prediction. The results underline their potential for real-time monitoring, smart city integration, and proactive environmental management, offering a robust solution for addressing urban air pollution challenges.
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.003 |
| 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".