Inductive Spatio-Temporal Kriging with Physics-Guided Increment Training Strategy for Air Quality Inference

• URL: http://arxiv.org/abs/2503.09646v1
• Date: Wed, 12 Mar 2025 08:14:46 GMT
• Title: Inductive Spatio-Temporal Kriging with Physics-Guided Increment Training Strategy for Air Quality Inference
• Authors: Songlin Yang, Tao Yang, Bo Hu,
• Abstract summary: This paper presents a Physics-Guided Increment Training Strategy (PGITS) for estimating air quality at unobserved locations.<n>By using physics principles as a bridge between virtual and real nodes, this strategy ensures the features of virtual nodes are closer to actual nodes for effective kriging.
• Score: 25.08033305174559
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The deployment of sensors for air quality monitoring is constrained by high costs, leading to inadequate network coverage and data deficits in some areas. Utilizing existing observations, spatio-temporal kriging is a method for estimating air quality at unobserved locations during a specific period. Inductive spatio-temporal kriging with increment training strategy has demonstrated its effectiveness using virtual nodes to simulate unobserved nodes. However, a disparity between virtual and real nodes persists, complicating the application of learning patterns derived from virtual nodes to actual unobserved ones. To address these limitations, this paper presents a Physics-Guided Increment Training Strategy (PGITS). Specifically, we design a dynamic graph generation module to incorporate the advection and diffusion processes of airborne particles as physical knowledge into the graph structure, dynamically adjusting the adjacency matrix to reflect physical interactions between nodes. By using physics principles as a bridge between virtual and real nodes, this strategy ensures the features of virtual nodes and their pseudo labels are closer to actual nodes. Consequently, the learned patterns of virtual nodes can be applied to actual unobserved nodes for effective kriging.

Related papers

• Virtual Nodes Improve Long-term Traffic Prediction [9.125554921271338]
  This study introduces a novel framework that incorporates virtual nodes, which are additional nodes added to the graph and connected to existing nodes.<n>Our proposed model incorporates virtual nodes by constructing a semi-adaptive adjacency matrix.<n> Experimental results demonstrate that the inclusion of virtual nodes significantly enhances long-term prediction accuracy.
  arXiv  Detail & Related papers  (2025-01-17T09:09:01Z)
• DarkFarseer: Inductive Spatio-temporal Kriging via Hidden Style Enhancement and Sparsity-Noise Mitigation [9.966211056209119]
  High costs of building sensor networks limit their scale and coverage, making fine-grained deployment challenging.<n>Inductctive Spatio-Temporal Kriging (ISK) addresses this issue by introducing virtual sensors.<n>We propose DarkFarseer, a novel ISK framework with three key components.
  arXiv  Detail & Related papers  (2025-01-06T07:11:34Z)
• Conservation-informed Graph Learning for Spatiotemporal Dynamics Prediction [84.26340606752763]
  In this paper, we introduce the conservation-informed GNN (CiGNN), an end-to-end explainable learning framework.<n>The network is designed to conform to the general symmetry conservation law via symmetry where conservative and non-conservative information passes over a multiscale space by a latent temporal marching strategy.<n>Results demonstrate that CiGNN exhibits remarkable baseline accuracy and generalizability, and is readily applicable to learning for prediction of varioustemporal dynamics.
  arXiv  Detail & Related papers  (2024-12-30T13:55:59Z)
• ST-FiT: Inductive Spatial-Temporal Forecasting with Limited Training Data [59.78770412981611]
  In real-world applications, most nodes may not possess any available temporal data during training.<n>We propose a principled framework named ST-FiT to handle this problem.
  arXiv  Detail & Related papers  (2024-12-14T17:51:29Z)
• CTRL: Continuous-Time Representation Learning on Temporal Heterogeneous Information Network [32.42051167404171]
  We propose a Continuous-Time Representation Learning model on temporal HINs. We train the model with a future event (a subgraph) prediction task to capture the evolution of the high-order network structure. The results demonstrate that our model significantly boosts performance and outperforms various state-of-the-art approaches.
  arXiv  Detail & Related papers  (2024-05-11T03:39:22Z)
• KITS: Inductive Spatio-Temporal Kriging with Increment Training Strategy [21.19416886799383]
  Kriging is the tailored task to infer the unobserved nodes (without sensors) using the observed source nodes (with sensors)<n>We present a novel Increment training strategy: instead of nodes (and reconstructing them), we add virtual nodes into the training graph so as to the graph gap masking issue naturally.<n>We name our new Kriging model with Increment Training Strategy as KITS.
  arXiv  Detail & Related papers  (2023-11-05T04:43:48Z)
• Graph Condensation for Inductive Node Representation Learning [59.76374128436873]
  We propose mapping-aware graph condensation (MCond) MCond integrates new nodes into the synthetic graph for inductive representation learning. On the Reddit dataset, MCond achieves up to 121.5x inference speedup and 55.9x reduction in storage requirements.
  arXiv  Detail & Related papers  (2023-07-29T12:11:14Z)
• Temporal Aggregation and Propagation Graph Neural Networks for Dynamic Representation [67.26422477327179]
  Temporal graphs exhibit dynamic interactions between nodes over continuous time. We propose a novel method of temporal graph convolution with the whole neighborhood. Our proposed TAP-GNN outperforms existing temporal graph methods by a large margin in terms of both predictive performance and online inference latency.
  arXiv  Detail & Related papers  (2023-04-15T08:17:18Z)
• Uniting Heterogeneity, Inductiveness, and Efficiency for Graph Representation Learning [68.97378785686723]
  graph neural networks (GNNs) have greatly advanced the performance of node representation learning on graphs. A majority class of GNNs are only designed for homogeneous graphs, leading to inferior adaptivity to the more informative heterogeneous graphs. We propose a novel inductive, meta path-free message passing scheme that packs up heterogeneous node features with their associated edges from both low- and high-order neighbor nodes.
  arXiv  Detail & Related papers  (2021-04-04T23:31:39Z)
• Implicit Under-Parameterization Inhibits Data-Efficient Deep Reinforcement Learning [97.28695683236981]
  More gradient updates decrease the expressivity of the current value network. We demonstrate this phenomenon on Atari and Gym benchmarks, in both offline and online RL settings.
  arXiv  Detail & Related papers  (2020-10-27T17:55:16Z)
• Inductive Representation Learning on Temporal Graphs [33.44276155380476]
  temporal dynamic graphs require handling new nodes as well as capturing temporal patterns. We propose the temporal graph attention layer to efficiently aggregate temporal-topological neighborhood features. By stacking TGAT layers, the network recognizes the node embeddings as functions of time and is able to inductively infer embeddings for both new and observed nodes.
  arXiv  Detail & Related papers  (2020-02-19T02:05:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.