Proposes a new QSGCNN model for graph classification.
problem Information loss and imprecise representation in existing GCN models.
method Quantum Spatial Graph Convolutional Neural Network (QSGCNN) model.
result Demonstrates effectiveness on benchmark graph classification datasets.
Develops BASGCN for graph classification with improved feature learning.
problem Graph classification with information loss and imprecise representation.
method Transforms graphs into grid structures and defines a new spatial graph convolution operation.
result Reduces information loss and improves feature representation compared to existing models.
The paper bridges spectral and spatial graph convolutions, improving model capacity and transferability.
problem Improving graph neural networks by bridging spectral and spatial design.
method Theoretical demonstration and general framework for spectral analysis, new spectral convolutions, and depthwise separable convolutions.
result General framework allows spectral analysis of ConvGNNs, showing their performance and limits, and proposing new spectral convolutions.
Proposes SGCN for spatially structured data.
problem Lack of node neighbor ordering in GCNs.
method Uses spatial features to learn from graphs with spatial positions.
result Empirically outperforms state-of-the-art methods.
Graph CNN method improves classification of irregular spatial data like building patterns.
problem Challenges in analyzing irregular spatial data with machine learning.
method Graph Fourier transform and convolution theorem to convert irregular spatial data into a learnable format.
result Significantly improved classification of building patterns compared to other methods.
New approach uses graphs for sign language recognition.
problem Challenges in recognizing sign language for deaf individuals.
method Spatial-Temporal Graph Convolutional Network.
result Improved sign language recognition using human skeletal movements.
New approach uses neural networks to predict quantum advantage on graphs.
problem Predicting quantum advantage on arbitrary graphs without simulations.
method Convolutional neural network designed to learn from graphs.
result Convolutional neural network predicts quantum advantage without simulations.
The understanding of geographical reality is a process of data representation and pattern discovery. Former studies mainly adopted continuous-field models to represent spatial variables and to investigate the underlying spatial continuity/heterogeneity in the regular spatial domain. In this article, we introduce a more…
AGCRN forecasts traffic using adaptive graph and recurrent learning.
problem Forecasting traffic dynamics with complex spatial and temporal correlations.
method Adaptive Graph Convolutional Recurrent Network (AGCRN) with Node Adaptive Parameter Learning (NAPL) and Data Adaptive Graph Generation (DAGG).
result AGCRN outperforms state-of-the-art models without pre-defined graphs.
Novel graph model forecasts urban traffic with reduced spatial complexity.
problem Challenges in traffic forecasting due to spatio-temporal complexity, especially in urban environments.
method MW-TGC network model that combines spatial and temporal dependencies using multi-weighted adjacency matrices and graph convolution operations.
result MW-TGC network outperforms other models in urban-core and urban-mix sites, reducing variance in heterogeneous environments.
Spatial graph representation improves GNN performance.
problem GNNs struggle with distinguishing similar local structures in different graph locations.
method Proposes a spatial graph representation method to distinguish local structures and simplify graph downsampling.
result Proposed graph pooling method achieves competitive results.
This paper introduces a generalization of Convolutional Neural Networks (CNNs) from low-dimensional grid data, such as images, to graph-structured data. We propose a novel spatial convolution utilizing a random walk to uncover the relations within the input, analogous to the way the standard convolution uses the spatia…
A new method classifies hyperspectral images using dynamic graph convolutional networks.
problem Complex spatial context in HSI classification leads to inaccurate results.
method Develops a GCN-based method that captures long-range contextual relations and refines graph edges.
result Significant improvement in HSI classification performance compared to state-of-the-art methods.
3D-TGCN learns road graphs from time series similarity for spatio-temporal traffic forecasting.
problem Challenging spatio-temporal prediction in traffic networks due to dependency and dynamics.
method Proposes 3D-TGCN with novel components: spatial information-free road graph and 3D graph convolution.
result 3D-TGCN outperforms state-of-the-art baselines in traffic forecasting.
Graph diffusion convolution improves graph learning by leveraging generalized graph diffusion.
problem Noisy and arbitrarily defined edges in real graphs.
method Graph diffusion convolution (GDC) using generalized graph diffusion like heat kernel and personalized PageRank.
result Replacing message passing with graph diffusion convolution leads to significant performance improvements.
Study compares deep learning models for traffic forecasting, highlighting graph elements' impact.
problem Challenges in forecasting spatial-temporal traffic patterns.
method In-depth comparative study of four deep neural network models with different basic elements.
result Graph attention improves long-term predictions in traffic forecasting models.
T-GCN predicts traffic using neural networks for spatial and temporal data.
problem Accurate real-time traffic forecasting in urban networks.
method Combines GCN for spatial and GRU for temporal data analysis.
result T-GCN outperforms state-of-the-art baselines on real-world traffic datasets.
A3T-GCN improves traffic forecasting by capturing spatial and temporal dependencies.
problem Accurate real-time traffic forecasting in complex road networks.
method Attention Temporal Graph Convolutional Network (A3T-GCN) integrating recurrent units and graph convolutional network.
result Improved prediction accuracy through attention mechanism and global temporal information.
Improved graph convolutional networks using perturbed graph Laplacian.
problem Improving graph convolutional networks' generalization.
method Minimizing loss with perturbed graph Laplacian eigendecomposition.
result Consistent improvement on semi-supervised node classification tasks.
MRA-BGCN improves traffic forecasting accuracy through complex graph interactions.
problem Challenging traffic forecasting due to spatial-temporal dependency and uncertainty.
method Proposes MRA-BGCN, a deep learning model that uses bicomponent graph convolution and multi-range attention.
result MRA-BGCN achieves state-of-the-art results on real-world traffic datasets.
LanczosNet uses Lanczos algorithm for efficient graph convolution.
problem Efficiently capturing multi-scale information in graph data.
method Lanczos algorithm for low-rank graph Laplacian approximation, learnable spectral filters.
result LanczosNet achieves state-of-the-art performance on citation networks and QM8.
This paper introduces Graph Convolutional Recurrent Network (GCRN), a deep learning model able to predict structured sequences of data. Precisely, GCRN is a generalization of classical recurrent neural networks (RNN) to data structured by an arbitrary graph. Such structured sequences can represent series of frames in v…
TK-GCN forecasts spatiotemporal dynamics using Koopman-enhanced graph convolutional networks.
problem Forecasting complex spatiotemporal dynamics over irregular domains.
method Two-stage framework: Koopman-enhanced Graph Convolutional Network (K-GCN) for spatial encoding and Transformer for temporal modeling.
result TK-GCN outperforms state-of-the-art methods in spatiotemporal cardiac dynamics forecasting.
SHARE predicts city-wide parking availability using a hierarchical graph neural network.
problem Predicting city-wide parking availability is challenging due to spatial and temporal autocorrelation.
method SHARE uses a hierarchical graph convolution structure with contextual and soft clustering blocks, a recurrent neural network, and a parking availability approximation module.
result SHARE outperforms state-of-the-art baselines in predicting city-wide parking availability.
Proposes a method to improve urban spatiotemporal forecasting using multi-modal graph interaction.
problem Improving spatiotemporal forecasting in urban areas using graph convolution networks.
method Develops modality interaction mechanisms for multi-graph convolution networks to reduce generalization error.
result Proposed techniques improve prediction accuracy and model robustness compared to state-of-the-art baselines.
Enhances GCNs to resist graph attacks.
problem Vulnerability of GCNs to topological attacks.
method Introduces a new robust convolution operator and training paradigm.
result Improves adversarial robustness and performance.
Machine learning predicts quantum advantage in noisy quantum walks.
problem Finding optimal graph types and coherence requirements for quantum advantage.
method Convolutional neural network trained on simulated examples of quantum walks on cycle graphs.
result Machine learning can predict quantum advantage for a wide range of decoherence parameters.
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of ribbon graphs. We describe an extension of the flow polynomial to virtual graphs, t…
Traffic forecasting is a particularly challenging application of spatiotemporal forecasting, due to the time-varying traffic patterns and the complicated spatial dependencies on road networks. To address this challenge, we learn the traffic network as a graph and propose a novel deep learning framework, Traffic Graph C…
Spatial orderness metric improves CNN performance for non-spatial data.
problem Improving CNN performance for data lacking spatial order.
method Proposed spatial orderness metric to quantify spatial ordering.
result Adding convolutional layers is counterproductive for non-spatial data.
Deep learning model predicts traffic flows across entire network for multiple steps ahead.
problem Accurately forecasting future traffic flows across all network links.
method Spatial-Temporal Sequence to Sequence (STSeq2Seq) model combining seq2seq and graph convolution.
result STSeq2Seq achieves state-of-the-art performance in traffic forecasting.
A deep learning model for traffic forecasting in telecommunication networks.
problem Complex spatial-temporal dependency in traffic forecasting.
method Spatio-Temporal Hybrid Graph Convolutional Network (STHGCN) combining GRUs and hybrid-GCN.
result The proposed model outperforms classical and state-of-the-art methods.
Graph WaveNet models spatial-temporal graphs by learning hidden dependencies and long sequences.
problem Capturing hidden spatial dependencies and long-range temporal sequences in graphs.
method Graph WaveNet integrates adaptive dependency matrix learning and stacked dilated 1D convolution.
result Graph WaveNet outperforms existing methods on public traffic network datasets.
GACAN combines multi-granularity time series for traffic forecasting.
problem High dynamics and complex spatial-temporal dependency of road networks in traffic forecasting.
method Graph Attention-Convolution-Attention Networks (GACAN) with Att-Conv-Att (ACA) block.
result GACAN outperforms state-of-the-art baselines in traffic forecasting.
A deep learning model predicts traffic conditions over multiple steps.
problem Multistep traffic forecasting on road networks.
method Attention Graph Convolutional Sequence-to-Sequence model (AGC-Seq2Seq) with attention mechanism.
result AGC-Seq2Seq model outperforms other models in multistep traffic prediction.
Improved spectral-based GCN for directed graphs.
problem Cannot directly work on directed graphs.
method Redefined Laplacians to improve propagation model.
result Outperforms state-of-the-art methods on directed graph datasets.
Introduces Spectral Graph Network combining spatial and spectral message passing.
problem Relational reasoning in graph structured data.
method Applies message passing to both spatial and spectral domains of a graph.
result Promotes efficient training with fewer iterations and robustness to edge dropout.
Spatiotemporal forecasting has various applications in neuroscience, climate and transportation domain. Traffic forecasting is one canonical example of such learning task. The task is challenging due to (1) complex spatial dependency on road networks, (2) non-linear temporal dynamics with changing road conditions and (…
New graph convolution captures local features on non-Euclidean grids.
problem Capturing local features on irregular, coarse non-Euclidean grids.
method Low-rank learnable local filters in graph convolutions.
result Proves more expressive than previous spectral graph convolution methods.
QCNNs avoid barren plateaus, making them trainable.
problem Exponentially vanishing gradients in QNNs.
method Graph-based method to analyze Haar-distributed unitaries.
result QCNNs do not exhibit barren plateaus, implying trainability.
Improved taxi demand-supply forecasts using graph-based LSTM.
problem Accurate taxi demand-supply forecasting with complex spatial and temporal patterns.
method Investigated impact of spatial partitioning techniques (Voronoi vs. Geohash) on LSTM network performance.
result GraphLSTM offers competitive performance against ConvLSTM, at lower complexity, across real-world data sets.
STG2Seq predicts multi-step passenger demand with graph and hierarchical structure.
problem Predicting passenger demand over multiple time horizons is challenging due to nonlinear and dynamic spatial-temporal dependencies.
method Proposes a graph-based model with a hierarchical graph convolutional structure to capture spatial and temporal correlations.
result Consistently outperforms baseline and state-of-the-art models on real-world datasets.
Novel graph network learns hierarchical network structure.
problem Lack of information in hierarchical network topology.
method Hierarchical clustering for multiscale decomposition, graph convolutional layers.
result Competitive performance on citation network benchmark.
Bayesian optimization on cardiac models using a graph convolutional VAE.
problem Optimizing tissue properties in cardiac models with spatially varying properties.
method Graph convolutional VAE for generative modeling of non-Euclidean data.
result Effective optimization of cardiac tissue properties using a novel generative model.
PSTN improves traffic condition forecasting with deep neural networks.
problem Challenges in accurately forecasting traffic conditions due to complex spatiotemporal correlations.
method Proposes PSTN with three modules: graph convolutional network, temporal convolutional network, and gated recurrent unit framework.
result Significantly outperforms state-of-the-art benchmarks in short-term traffic conditions forecasting.
3DGCN predicts molecular properties and biochemical activities using 3D molecular graph.
problem Predicting molecular properties and biochemical activities from 3D molecular graphs.
method Unified graph convolution with learning operations to handle spatial information, distinguishing 3D rotations.
result Significantly higher performance on various molecular tasks compared to other deep-learning models.
ChebLieNet uses Lie groups to create invariant spectral graph networks.
problem Handling anisotropic data in graph neural networks.
method Develops anisotropic convolutional layers on Lie groups with Riemannian metrics.
result Demonstrates the effectiveness of balancing equivariance and invariance.
Introduces data augmentation for graph convolutional networks, proposing Monte Carlo Graph Learning.
problem Lack of transparency in graph convolutional networks.
method Data augmentation through graph structure, training traditional classifiers on expanded training set.
result MCGL shows better tolerance to graph structure noise than GCN on noisy graphs.