Spatially Regularized Graph Attention Autoencoder Framework for Detecting Rainfall Extremes

2024-11-12 · Mihir Agarwal, Progyan Das, Udit Bhatia

We introduce a novel Graph Attention Autoencoder (GAE) with spatial regularization to address the challenge of scalable anomaly detection in spatiotemporal rainfall data across India from 1990 to 2015. Our model leverages a Graph Attention Network (GAT) to capture spatial dependencies and temporal dynamics in the data, further enhanced by a spatial regularization term ensuring geographic coherence. We construct two graph datasets employing rainfall, pressure, and temperature attributes from the Indian Meteorological Department and ERA5 Reanalysis on Single Levels, respectively. Our network operates on graph representations of the data, where nodes represent geographic locations, and edges, inferred through event synchronization, denote significant co-occurrences of rainfall events. Through extensive experiments, we demonstrate that our GAE effectively identifies anomalous rainfall patterns across the Indian landscape. Our work paves the way for sophisticated spatiotemporal anomaly detection methodologies in climate science, contributing to better climate change preparedness and response strategies.

📄 PDF Abstract BibTeX arXiv:2411.07753

Code (0)

등록된 구현이 없습니다.

Tasks

Anomaly DetectionGraph Attention

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Attention 설명 없음

Deep Spatially-Regularized and Superpixel-Based Diffusion Learning for Unsupervised Hyperspectral Image Clustering

2026-04-14 · Vutichart Buranasiri, James M. Murphy arxiv

An unsupervised framework for hyperspectral image (HSI) clustering is proposed that incorporates masked deep representation learning with diffusion-based clustering, extending the Spatially-Regularized Superpixel-based D…

Representation Learning Image Clustering

Adversarially Regularized Graph Autoencoder for Graph Embedding

2018-02-13 · Shirui Pan, Ruiqi Hu, Guodong Long, Jing Jiang 외

Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the …

Clustering Decoder Graph Clustering Graph Embedding+1

Wasserstein Adversarially Regularized Graph Autoencoder

2021-11-09 · Huidong Liang, Junbin Gao

This paper introduces Wasserstein Adversarially Regularized Graph Autoencoder (WARGA), an implicit generative algorithm that directly regularizes the latent distribution of node embedding to a target distribution via the…

Clustering Link Prediction Node Clustering

DCA: Graph-Guided Deep Embedding Clustering for Brain Atlases

2025-09-01 · Mo Wang, Kaining Peng, Jingsheng Tang, Hongkai Wen 외 arxiv

Brain atlases are essential for reducing the dimensionality of neuroimaging data and enabling interpretable analysis. However, most existing atlases are predefined, group-level templates with limited flexibility and reso…

Deep Clustering

Learning Graph Embedding with Adversarial Training Methods

2019-01-04 · Shirui Pan, Ruiqi Hu, Sai-fu Fung, Guodong Long 외

Graph embedding aims to transfer a graph into vectors to facilitate subsequent graph analytics tasks like link prediction and graph clustering. Most approaches on graph embedding focus on preserving the graph structure o…

Clustering Decoder Graph Clustering Graph Embedding+2