Learnable Spectral Wavelets on Dynamic Graphs to Capture Global Interactions
Learning on evolving(dynamic) graphs has caught the attention of researchers as static methods exhibit limited performance in this setting. The existing methods for dynamic graphs learn spatial features by local neighborhood aggregation, which essentially only captures the low pass signals and local interactions. In this work, we go beyond current approaches to incorporate global features for effectively learning representations of a dynamically evolving graph. We propose to do so by capturing the spectrum of the dynamic graph. Since static methods to learn the graph spectrum would not consider the history of the evolution of the spectrum as the graph evolves with time, we propose a novel approach to learn the graph wavelets to capture this evolving spectra. Further, we propose a framework that integrates the dynamically captured spectra in the form of these learnable wavelets into spatial features for incorporating local and global interactions. Experiments on eight standard datasets show that our method significantly outperforms related methods on various tasks for dynamic graphs.
Code (1)
Similar Papers 제목 키워드 기반
Adaptive Gaussian Processes on Graphs via Spectral Graph Wavelets
Graph-based models require aggregating information in the graph from neighbourhoods of different sizes. In particular, when the data exhibit varying levels of smoothness on the graph, a multi-scale approach is required t…
Gaussian ProcessesOptimisation of Spectral Wavelets for Persistence-based Graph Classification
A graph's spectral wavelet signature determines a filtration, and consequently an associated set of extended persistence diagrams. We propose a framework that optimises the choice of wavelet for a dataset of graphs, such…
ClassificationGeneral ClassificationGraph ClassificationGraph Embedding via Diffusion-Wavelets-Based Node Feature Distribution Characterization
Recent years have seen a rise in the development of representational learning methods for graph data. Most of these methods, however, focus on node-level representation learning at various scales (e.g., microscopic, meso…
Graph EmbeddingRepresentation LearningSpectral Graph Attention Network with Fast Eigen-approximation
Variants of Graph Neural Networks (GNNs) for representation learning have been proposed recently and achieved fruitful results in various fields. Among them, Graph Attention Network (GAT) first employs a self-attention s…
Graph AttentionNode ClassificationRepresentation LearningHyperedge Representations with Hypergraph Wavelets: Applications to Spatial Transcriptomics
In many data-driven applications, higher-order relationships among multiple objects are essential in capturing complex interactions. Hypergraphs, which generalize graphs by allowing edges to connect any number of nodes, …