Enhancing Kriging with Inductive Spatio-Temporal GraphODE
Bibliographic record
Abstract
Sensory networks in environmental monitoring provide real-time data on critical parameters, but the costs of installation and maintenance limit high-resolution data acquisition. Researchers aim to estimate values at specific locations without prior data samples, considering two approaches: virtual sensors and kriging. While virtual sensors face challenges in dynamic sensor networks where for every sensor added or disconnected the whole network should be retrained, kriging, especially spatio-temporal kriging using Graph Neural Networks, overcomes traditional kriging drawbacks and allows adaptability in dynamic sensor networks without frequent retraining. Despite their success, existing spatio-temporal kriging methods face challenges, notably the over-smoothing problem, restricting their ability to utilize deeper graph structures for a more comprehensive latent representation. In this paper, we propose a two-part method based on neural differential equations. The first part estimates values using spatial adjacency, while the second part refines these estimates considering temporal dependencies. Our approach explicitly addresses the over-smoothing problem, leading to a 2-8% improvement over state-of-the-art baseline methods. The results hold promise for enhancing the accuracy and effectiveness of environmental monitoring applications.
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".