BiGraphNet generalizes graph neural networks for more efficient operations.
problem Fragmented graph neural network architectures hinder optimization.
method Explicitly separates input and output nodes, enabling new efficient operations.
result BiGraphNet accelerates and scales computations in hierarchical networks.
Combines BERT and graph CNN for improved text classification.
problem Text classification problems
method Combining BERT embedding and graph convolutional neural network
result Graph CNN model performs better than classical models combined with BERT
AdaGCN uses AdaBoost to efficiently integrate high-order neighbor knowledge in graph neural networks.
problem Efficiently exploring and exploiting knowledge from different hops of neighbors in graph neural networks.
method Incorporates AdaBoost into graph convolutional networks to integrate knowledge from high-order neighbors.
result AdaGCN achieves state-of-the-art prediction performance across different graphs and label rates.
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…
Graph convolutional networks fail to use eigenvectors beyond the first, unlike spectral embedding.
problem Understanding when graph convolutional networks fail compared to spectral embedding.
method Presented a simple generative model to illustrate failure.
result Graph convolutional networks fail to use eigenvectors beyond the first in certain graphs.
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.
The paper bounds the complexity of GCNs using Rademacher complexity.
problem Understanding the sample complexity of GCNs.
method Derived tight upper and lower bounds of Rademacher complexity for GCN models.
result The derived bounds depend on the largest eigenvalue of the graph filter and the degree distribution.
Paper improves graph convolutional networks by adjusting filter size.
problem Improving predictive performance of graph convolutional networks.
method Introducing a hyper-parameter to influence filter size in graph convolutions.
result Improves predictive performance of Deep Graph Convolutional Networks.
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.
Graph convolutional Gaussian processes learn functions on graphs.
problem Learning translation-invariant relationships on non-Euclidean domains.
method Bayesian nonparametric method using graph convolutional neural networks.
result Graph convolutional Gaussian processes outperform existing methods on images and triangular meshes.
A distributed algorithm for training graph convolutional networks.
problem Training graph convolutional networks with sparse network topology and distributed agents.
method Formulate inference and optimization in a distributed scenario, propose a gradient descent procedure, and design communication topology.
result Convergence to stationary solutions of the GCN training problem under mild conditions.
Indirect attacks can fool graph classifiers even with poisoned neighbors.
problem How to evaluate and defend graph convolutional neural networks against indirect adversarial attacks.
method Proposed a method to generate adversarial perturbations on a single node far from the target.
result 99% attack success rate within two-hops from the target in two datasets.
DEMO-Net improves graph neural networks by focusing on node degree.
problem Limited analysis of graph convolution properties and lack of degree-specific graph structure.
method Proposes DEMO-Net, a degree-specific graph neural network that recursively identifies 1-hop neighborhood structures and uses multi-task learning for node representation learning.
result Demonstrates effectiveness and efficiency of DEMO-Net on node and graph classification benchmarks.
Graph Convolutional Gaussian Processes predict missing links.
problem Link prediction in large graphs.
method Simplified graph convolutions and variational inducing point method.
result Consistent improvements over existing models and competitive performance.
Graph Convolutional Networks improve performance on complex data.
problem Processing high-dimensional, graph-based data for automation.
method Enhanced existing Graph Convolutional Network models with four improvements.
result Significant performance improvements on four benchmark datasets.
This paper uses graph convolutional networks to improve the accuracy of neural architecture search.
problem Improving the precision of sampled sub-networks in weight-sharing NAS.
method Training a graph convolutional network to fit the performance of sampled sub-networks.
result Achieved higher rank correlation coefficient and better final architecture performance.
Paper analyzes GCNN sensitivity to probabilistic graph perturbations.
problem Investigating how GCNNs handle probabilistic graph errors.
method Establishes error bounds and linear relationships between GSO perturbations and GCNN outputs.
result GCNNs maintain stability under graph edge perturbations if GSO errors are bounded.
Graph neural networks can be adapted to new graphs with a limit object called graphon NNs.
problem Transferability of graph neural networks across different graphs.
method Introduced graphon NNs as limit objects of GNNs and proved a bound on the difference between GNN and graphon-NN outputs.
result The bound on the difference between GNN and graphon-NN outputs vanishes with growing number of nodes if the graph convolutional filters are bandlimited.
Sparse molecular representations improve interpretability in graph neural networks.
problem Difficulty in understanding which molecular graph aspects drive deep learning predictions.
method Constrain weights in a graph convolutional neural network using the Gini index to maximize representation inequality.
result The Gini-constrained approach does not degrade evaluation metrics and allows for interpretable representation combination.
Geom-GCN improves graph neural networks by preserving structural information and capturing long-range dependencies.
problem Weaknesses in MPNNs' aggregators: loss of structural information and lack of long-range dependencies.
method Proposes a geometric aggregation scheme with three modules: node embedding, structural neighborhood, and bi-level aggregation.
result Achieved state-of-the-art performance on various graph datasets.
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.
Graph convolutional kernel networks generalize CNNs to graph data.
problem Representing graph-structured data for machine learning.
method Convolutional kernel networks applied to graph data.
result Competitive performance on graph classification benchmarks.
Optimal algorithms identified for semi-supervised classification on graphs.
problem Clustering and classification on graphs with relational and feature information.
method Bayesian inference and belief propagation, extended to graph convolution neural networks.
result Identification of a phase transition and asymptotically optimal algorithms.
Proposes dynamic graph and node feature learning in GCNNs for better adaptability.
problem Fixed graphs for all GCNN layers limit adaptability to node feature structures.
method Dynamic graph and node feature learning using Mahalanobis distance metric.
result Superior performance in point clouds and citation networks.
GCNN research tackles graph data topology and prediction.
problem Graphs' irregularity and complexity make traditional CNN methods unsuitable.
method Review and categorization of GCNN techniques.
result TAGCN approach shows promise for improving graph data prediction.
The paper analyzes stability and generalization of GCNNs on graphs.
problem Theoretical understanding of GCNN models' generalization properties.
method Analysis of stability and derivation of generalization guarantees for semi-supervised graph learning.
result The stability of GCNN models depends on the largest absolute eigenvalue of the graph convolution filter.
GCRNNs improve graph problem solving with fewer parameters.
problem Graph process problems like earthquake epicenter identification and weather prediction.
method GCRNNs use convolutional filter banks and time-gated variations of GCRNNs (Gated GCRNNs) to improve performance.
result GCRNNs significantly improve performance over GNNs and another graph recurrent architecture.
The paper introduces a pooling mechanism for graph CNNs using NMF.
problem Pooling in graph structured data for efficient computation.
method Non-negative matrix factorization for node pooling.
result The pooling mechanism improves graph classification performance.
GCNs learn by embedding similar nodes within a class and leveraging consistent neighborhood structures.
problem Understanding how GCNs perform semi-supervised node classification on both homophilous and heterophilous graphs.
method Investigated the latent node embeddings and neighborhood structures of GCNs.
result GCNs learn by embedding similar nodes within a class and leveraging consistent neighborhood structures.
Graph convolutional deep kernel machine learns representations for graph tasks.
problem Limited representation learning in infinite-width neural networks.
method Developed a graph convolutional deep kernel machine as an infinite-width limit.
result Representation learning improves performance for heterophilous node classification tasks.
Improves molecular activity prediction using graph convolutional neural networks considering graph distances.
problem Predicting molecular activity using graph convolutional neural networks with improved distance representation.
method Proposed three improvements: modified graph distances, distance-dependent weight matrices, and weighted sum conversion.
result The proposed method slightly outperforms the original weave module in compound activity prediction.
Spectral graph convolutional neural networks (CNNs) require approximation to the convolution to alleviate the computational complexity, resulting in performance loss. This paper proposes the topology adaptive graph convolutional network (TAGCN), a novel graph convolutional network defined in the vertex domain. We provi…
GC-Flow uses graph flows for better clustering than traditional GCNs.
problem Traditional GCNs miss useful clustering information.
method Designing normalizing flows to replace GCN layers, creating a generative model.
result GC-Flow produces well-separated clusters while maintaining predictive power.
Paper generalizes GCNNs using edge-variant recursions for better graph signal classification.
problem Improving graph signal classification performance.
method Formulates a general framework for GCNNs using edge-variant graph filters.
result Shows superior performance in graph signal classification problems.
Improved GCNNs tackle noisy knowledge graphs for better link prediction.
problem Link prediction on noisy biomedical knowledge graphs.
method Regularized attention mechanism for GCNNs, interpretable visualization methods.
result Improved performance on noisy datasets, automated denoising potential.
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.
Bayesian GCNN uses node copying for graph inference.
problem Uncertainty in graph structure.
method Generative model based on node copying within BGCN framework.
result Proposed algorithm outperforms state-of-the-art in node classification tasks.
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.
Graph Convolutional Neural Networks identify molecular functional groups.
problem Automatic discovery of molecular functional groups to reduce lab experiments.
method Graph Convolutional Neural Networks (GCNNs) trained on relational graphs of molecules.
result Grad-CAM method identified the most specific and relevant molecular substructures.
Develops neural network for directed hypergraphs for node classification.
problem Irregular data structure, particularly directed graphs.
method Directed hypergraph neural network and semi-supervised learning method.
result Novel directed hypergraph neural network achieves highest accuracies on node classification tasks.
EWS-GCN improves credit scoring by analyzing money transfer connections.
problem Improving credit scoring in transactional banking data.
method Edge Weight-Shared Graph Convolutional Network (EWS-GCN) combining graph and recurrent neural networks.
result EWS-GCN outperforms state-of-the-art models in credit scoring.
HGCN uses hyperbolic geometry to improve graph node embeddings.
problem Distortion in Euclidean embeddings of real-world graphs.
method Derives GCN operations in hyperbolic space and maps Euclidean features to hyperbolic embeddings.
result HGCN achieves up to 63.1% error reduction in ROC AUC for link prediction.
Graph neural networks generalize well under certain conditions, explained by learning theory.
problem Understanding why graph neural networks generalize well in transductive inference.
method Analysis of transductive Rademacher complexity to explain generalization properties of graph convolutional networks.
result Transductive Rademacher complexity can explain the generalization of graph convolutional networks for node classification in stochastic block models.
AEGCN uses autoencoder constraints to improve graph node classification.
problem Node classification on graph domains with reduced information loss.
method Autoencoder-constrained graph convolutional network (AEGCN).
result Adding autoencoder constraints significantly improves graph convolutional network performance.
Combines BERT and GCN for better text classification.
problem Limited global information capture by BERT.
method Integrates BERT with VGCN for improved text classification.
result VGCN-BERT outperforms BERT and GCN alone.
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.
RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.
problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.
Predicts fracture evolution and material failure in brittle materials.
problem Predicting how fractures propagate and materials fail in brittle materials.
method Recurrent graph convolutional neural networks trained on simulation data.
result Predictions within 3% for fracture damage and 15% for time to failure.