Classic
PubMed
Structure
1Graphs
19,717Nodes
44,338Edges
3Classes
500Node Feature Dim
0.7924Homophily
Coverage
1254Results
1Variants
184Papers
- ICML 2026: RADE: Random Add-Drop Edge as a Regularizer RADE: Random Add-Drop Edge as a Regularizer ICML 2026
- Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification
- Adaptive Negative Scheduling for Graph Contrastive Learning Adaptive Negative Scheduling for Graph Contrastive Learning
- ICLR 2026: Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors ICLR 2026
- Geometric Evolution Graph Convolutional Networks: Enhancing Graph Representation Learning via Ricci Flow Geometric Evolution Graph Convolutional Networks: Enhancing Graph Representation Learning via Ricci Flow
- TMLR 2026: Poisoning the Inner Prediction Logic of Graph Neural Networks for Clean-Label Backdoor Attacks Poisoning the Inner Prediction Logic of Graph Neural Networks for Clean-Label Backdoor Attacks TMLR 2026
- Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger Heterophily-Agnostic Hypergraph Neural Networks with Riemannian Local Exchanger
- WWW 2026: VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention WWW 2026
- KDD 2026: Generalizing GNNs with Tokenized Mixture of Experts Generalizing GNNs with Tokenized Mixture of Experts KDD 2026
- Position: Don't be Afraid of Over-Smoothing And Over-Squashing Position: Don't be Afraid of Over-Smoothing And Over-Squashing
- Rethinking Semi-Supervised Node Classification with Self-Supervised Graph Clustering Rethinking Semi-Supervised Node Classification with Self-Supervised Graph Clustering
- Gauge-Equivariant Graph Networks via Self-Interference Cancellation Gauge-Equivariant Graph Networks via Self-Interference Cancellation
- Turning Tabular Foundation Models into Graph Foundation Models Turning Tabular Foundation Models into Graph Foundation Models
- Quantum Graph Attention Network: A Novel Quantum Multi-Head Attention Mechanism for Graph Learning Quantum Graph Attention Network: A Novel Quantum Multi-Head Attention Mechanism for Graph Learning
- KDD 2025: Discrepancy-Aware Graph Mask Auto-Encoder Discrepancy-Aware Graph Mask Auto-Encoder KDD 2025
- Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models
- Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach Uncertainty-Aware Graph Neural Networks: A Multi-Hop Evidence Fusion Approach
- TMLR 2025: Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment Efficient Text-Attributed Graph Learning through Selective Annotation and Graph Alignment TMLR 2025
- KDD 2025: Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening KDD 2025
- Adaptive Tokenization: On the Hop-Overpriority Problem in Tokenized Graph Learning Models Adaptive Tokenization: On the Hop-Overpriority Problem in Tokenized Graph Learning Models
- IJCAI 2025: Negative Metric Learning for Graphs Negative Metric Learning for Graphs IJCAI 2025
- IJCAI 2025: Rethinking Graph Contrastive Learning through Relative Similarity Preservation Rethinking Graph Contrastive Learning through Relative Similarity Preservation IJCAI 2025
- Wide & Deep Learning for Node Classification Wide & Deep Learning for Node Classification
- TMLR 2025: FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs TMLR 2025
- TMLR 2025: Heterophily-informed Message Passing Heterophily-informed Message Passing TMLR 2025
- WWW 2025: Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition WWW 2025
- TMLR 2025: Towards Efficient Training of Graph Neural Networks: A Multiscale Approach Towards Efficient Training of Graph Neural Networks: A Multiscale Approach TMLR 2025
- TMLR 2025: Diffusion on Graph: Augmentation of Graph Structure for Node Classification Diffusion on Graph: Augmentation of Graph Structure for Node Classification TMLR 2025
- LLM as GNN: Graph Vocabulary Learning for Text-Attributed Graph Foundation Models LLM as GNN: Graph Vocabulary Learning for Text-Attributed Graph Foundation Models
- KDD 2025: GCoT: Chain-of-Thought Prompt Learning for Graphs GCoT: Chain-of-Thought Prompt Learning for Graphs KDD 2025
- JMLR 2025: Enhancing Graph Representation Learning with Localized Topological Features Enhancing Graph Representation Learning with Localized Topological Features JMLR 2025
- Revisiting the Necessity of Graph Learning and Common Graph Benchmarks Revisiting the Necessity of Graph Learning and Common Graph Benchmarks
- NeurIPS 2024: Graph Neural Networks Need Cluster-Normalize-Activate Modules Graph Neural Networks Need Cluster-Normalize-Activate Modules NeurIPS 2024
- LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space
- ICLR 2024: When Graph Neural Networks Meet Dynamic Mode Decomposition When Graph Neural Networks Meet Dynamic Mode Decomposition ICLR 2024
- Negative-Free Self-Supervised Gaussian Embedding of Graphs Negative-Free Self-Supervised Gaussian Embedding of Graphs
- Disentangled Generative Graph Representation Learning Disentangled Generative Graph Representation Learning
- KDD 2024: TSC: A Simple Two-Sided Constraint against Over-Smoothing TSC: A Simple Two-Sided Constraint against Over-Smoothing KDD 2024
- Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimation Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimation
- All Against Some: Efficient Integration of Large Language Models for Message Passing in Graph Neural Networks All Against Some: Efficient Integration of Large Language Models for Message Passing in Graph Neural Networks
- Graph Structure Prompt Learning: A Novel Methodology to Improve Performance of Graph Neural Networks Graph Structure Prompt Learning: A Novel Methodology to Improve Performance of Graph Neural Networks
- ICLR 2024: The Effectiveness of Curvature-Based Rewiring and the Role of Hyperparameters in GNNs Revisited The Effectiveness of Curvature-Based Rewiring and the Role of Hyperparameters in GNNs Revisited ICLR 2024
- NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification
- NeurIPS 2024: GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights NeurIPS 2024
- KDD 2024: GAugLLM: Improving Graph Contrastive Learning for Text-Attributed Graphs with Large Language Models GAugLLM: Improving Graph Contrastive Learning for Text-Attributed Graphs with Large Language Models KDD 2024
- Graph Neural Reaction Diffusion Models Submitted to the editors June 2023. Accepted in March 2024. Graph Neural Reaction Diffusion Models Submitted to the editors June 2023. Accepted in March 2024.
- NeurIPS 2024: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights NeurIPS 2024
- ICML 2024: How Interpretable Are Interpretable Graph Neural Networks? How Interpretable Are Interpretable Graph Neural Networks? ICML 2024
- NeurIPS 2024: Cross-Domain Graph Data Scaling: A Showcase with Diffusion Models Cross-Domain Graph Data Scaling: A Showcase with Diffusion Models NeurIPS 2024
- Unleashing the Potential of Text-attributed Graphs: Automatic Relation Decomposition via Large Language Models Unleashing the Potential of Text-attributed Graphs: Automatic Relation Decomposition via Large Language Models
- ICLR 2024: Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning ICLR 2024
- LOGIN: A Large Language Model Consulted Graph Neural Network Training Framework LOGIN: A Large Language Model Consulted Graph Neural Network Training Framework
- E2GNN: Efficient Graph Neural Network Ensembles for Semi-Supervised Classification E2GNN: Efficient Graph Neural Network Ensembles for Semi-Supervised Classification
- Oversmoothing alleviation in graph neural networks: a survey and unified view Oversmoothing alleviation in graph neural networks: a survey and unified view
- WWW 2024: Polynomial Selection in Spectral Graph Neural Networks: An Error-Sum of Function Slices Approach Polynomial Selection in Spectral Graph Neural Networks: An Error-Sum of Function Slices Approach WWW 2024
- Graph Neural Aggregation-diffusion with Metastability Graph Neural Aggregation-diffusion with Metastability
- ADEdgeDrop: Adversarial Edge Dropping for Robust Graph Neural Networks ADEdgeDrop: Adversarial Edge Dropping for Robust Graph Neural Networks
- Revisiting Edge Perturbation for Graph Neural Network in Graph Data Augmentation and Attack Revisiting Edge Perturbation for Graph Neural Network in Graph Data Augmentation and Attack
- Teaching MLP More Graph Information: A Three-stage Multitask Knowledge Distillation Framework. Teaching MLP More Graph Information: A Three-stage Multitask Knowledge Distillation Framework.
- OpenGraph: Towards Open Graph Foundation Models OpenGraph: Towards Open Graph Foundation Models
- Design your own universe: a physics-informed agnostic method for enhancing graph neural networks Design your own universe: a physics-informed agnostic method for enhancing graph neural networks
- AAAI 2023: Curriculum-Enhanced Residual Soft An-Isotropic Normalization for Over-smoothness in Deep GNNs Curriculum-Enhanced Residual Soft An-Isotropic Normalization for Over-smoothness in Deep GNNs AAAI 2023
- LoG 2023: Propagate & Distill: Towards Effective Graph Learners Using Propagation-Embracing MLPs Propagate & Distill: Towards Effective Graph Learners Using Propagation-Embracing MLPs LoG 2023
- Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning
- KDD 2023: Marginal Nodes Matter: Towards Structure Fairness in Graphs Marginal Nodes Matter: Towards Structure Fairness in Graphs KDD 2023
- Spectral-Aware Augmentation for Enhanced Graph Representation Learning Spectral-Aware Augmentation for Enhanced Graph Representation Learning
- WWW 2023: Fast Graph Condensation with Structure-based Neural Tangent Kernel Fast Graph Condensation with Structure-based Neural Tangent Kernel WWW 2023
- TMLR 2023: Non-backtracking Graph Neural Networks Non-backtracking Graph Neural Networks TMLR 2023
- TMLR 2023: On the Equivalence of Graph Convolution and Mixup On the Equivalence of Graph Convolution and Mixup TMLR 2023
- Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learning Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learning
- UGSL: A Unified Framework for Benchmarking Graph Structure Learning UGSL: A Unified Framework for Benchmarking Graph Structure Learning
- The Expressive Power of Graph Neural Networks: A Survey The Expressive Power of Graph Neural Networks: A Survey
- Language is All a Graph Needs Language is All a Graph Needs
- ICLR 2023: VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs ICLR 2023
- AAAI 2023: Feature Transportation Improves Graph Neural Networks Feature Transportation Improves Graph Neural Networks AAAI 2023
- Graph Condensation for Inductive Node Representation Learning Graph Condensation for Inductive Node Representation Learning
- How Curvature Enhance the Adaptation Power of Framelet GCNs How Curvature Enhance the Adaptation Power of Framelet GCNs
- Frameless Graph Knowledge Distillation Frameless Graph Knowledge Distillation
- A Survey on Graph Neural Network Acceleration: Algorithms, Systems, and Customized Hardware A Survey on Graph Neural Network Acceleration: Algorithms, Systems, and Customized Hardware
- ICML 2023: Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication Graph Ladling: Shockingly Simple Parallel GNN Training without Intermediate Communication ICML 2023
- KDD 2023: HomoGCL: Rethinking Homophily in Graph Contrastive Learning HomoGCL: Rethinking Homophily in Graph Contrastive Learning KDD 2023
- Oversmoothing: A Nightmare for Graph Contrastive Learning? Oversmoothing: A Nightmare for Graph Contrastive Learning?
- ICML 2023: GC-Flow: A Graph-Based Flow Network for Effective Clustering GC-Flow: A Graph-Based Flow Network for Effective Clustering ICML 2023
- AAAI 2023: Union Subgraph Neural Networks Union Subgraph Neural Networks AAAI 2023
- ICML 2023: Feature Expansion for Graph Neural Networks Feature Expansion for Graph Neural Networks ICML 2023
- IJCAI 2023: Hierarchical Transformer for Scalable Graph Learning Hierarchical Transformer for Scalable Graph Learning IJCAI 2023
- WWW 2023: Node-wise Diffusion for Scalable Graph Learning Node-wise Diffusion for Scalable Graph Learning WWW 2023
- ICML 2023: Leveraging Label Non-Uniformity for Node Classification in Graph Neural Networks Leveraging Label Non-Uniformity for Node Classification in Graph Neural Networks ICML 2023
- Multi-View Graph Representation Learning Beyond Homophily Multi-View Graph Representation Learning Beyond Homophily
- Graph Contrastive Learning under Heterophily via Graph Filters Graph Contrastive Learning under Heterophily via Graph Filters
- Framelet Message Passing Framelet Message Passing
- Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks Building Shortcuts between Distant Nodes with Biaffine Mapping for Graph Convolutional Networks
- ICLR 2023: Discovering Data Geometry: Energy-Driven Neural Diffusion Discovering Data Geometry: Energy-Driven Neural Diffusion ICLR 2023
- ICML 2022: TIDE: Time Derivative Diffusion for Deep Learning on Graphs TIDE: Time Derivative Diffusion for Deep Learning on Graphs ICML 2022
- LoG 2022: You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets You Can Have Better Graph Neural Networks by Not Training Weights at All: Finding Untrained GNNs Tickets LoG 2022
- AAAI 2022: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating AAAI 2022
- Comprehensive Analysis of Over-smoothing in Graph Neural Networks from Markov Chains Perspective Comprehensive Analysis of Over-smoothing in Graph Neural Networks from Markov Chains Perspective
- Not All Neighbors Are Worth Attending to: Graph Selective Attention Networks for Semi-supervised Learning Not All Neighbors Are Worth Attending to: Graph Selective Attention Networks for Semi-supervised Learning
- NeurIPS 2022: Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again Old can be Gold: Better Gradient Flow can Make Vanilla-GCNs Great Again NeurIPS 2022
- AAAI 2022: Boosting Graph Neural Networks via Adaptive Knowledge Distillation Boosting Graph Neural Networks via Adaptive Knowledge Distillation AAAI 2022
- Uplifting Message Passing Neural Network with Graph Original Information Uplifting Message Passing Neural Network with Graph Original Information
- NeurIPS 2022: Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative Augmentations in Hypergraph Contrastive Learning: Fabricated and Generative NeurIPS 2022
- Towards Prototype-Based Self-Explainable Graph Neural Network Towards Prototype-Based Self-Explainable Graph Neural Network
- NeurIPS 2022: Revisiting Graph Contrastive Learning from the Perspective of Graph Spectrum Revisiting Graph Contrastive Learning from the Perspective of Graph Spectrum NeurIPS 2022
- GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials
- Enhancing Graph Contrastive Learning with Node Similarity Enhancing Graph Contrastive Learning with Node Similarity
- Generative Subgraph Contrast for Self-Supervised Graph Representation Learning Generative Subgraph Contrast for Self-Supervised Graph Representation Learning
- ICML 2022: Optimization-Induced Graph Implicit Nonlinear Diffusion Optimization-Induced Graph Implicit Nonlinear Diffusion ICML 2022
- ICML 2022: Structural Entropy Guided Graph Hierarchical Pooling Structural Entropy Guided Graph Hierarchical Pooling ICML 2022
- NeurIPS 2022: NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search NeurIPS 2022
- KDD 2022: Condensing Graphs via One-Step Gradient Matching Condensing Graphs via One-Step Gradient Matching KDD 2022
- AAAI 2022: I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs AAAI 2022
- Towards Understanding Graph Neural Networks: An Algorithm Unrolling Perspective Towards Understanding Graph Neural Networks: An Algorithm Unrolling Perspective
- Decoupled Self-supervised Learning for Non-Homophilou Graphs Decoupled Self-supervised Learning for Non-Homophilou Graphs
- Discovering the Representation Bottleneck of Graph Neural Networks Discovering the Representation Bottleneck of Graph Neural Networks
- Reinforcement learning on graphs: A survey Reinforcement learning on graphs: A survey
- Augmentation-Free Graph Contrastive Learning with Performance Guarantee Augmentation-Free Graph Contrastive Learning with Performance Guarantee
- Node Representation Learning in Graph via Node-to-Neighbourhood Mutual Information Maximization Node Representation Learning in Graph via Node-to-Neighbourhood Mutual Information Maximization
- Neighbor Enhanced Graph Convolutional Networks for Node Classification and Recommendation Neighbor Enhanced Graph Convolutional Networks for Node Classification and Recommendation
- WWW 2022: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm WWW 2022
- ICLR 2022: Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks ICLR 2022
- Graph Masked Autoencoders with Transformers Graph Masked Autoencoders with Transformers
- ICML 2022: Graph-Coupled Oscillator Networks Graph-Coupled Oscillator Networks ICML 2022
- NeurIPS 2022: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited NeurIPS 2022
- TMLR 2022: Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings TMLR 2022
- NeurIPS 2022: Contrastive Laplacian Eigenmaps Contrastive Laplacian Eigenmaps NeurIPS 2022
- AAAI 2021: Block Modeling-Guided Graph Convolutional Neural Networks Block Modeling-Guided Graph Convolutional Neural Networks AAAI 2021
- Simplifying approach to Node Classification in Graph Neural Networks Simplifying approach to Node Classification in Graph Neural Networks
- NeurIPS 2021: Beltrami Flow and Neural Diffusion on Graphs Beltrami Flow and Neural Diffusion on Graphs NeurIPS 2021
- ICLR 2021: Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation ICLR 2021
- AAAI 2021: Orthogonal Graph Neural Networks Orthogonal Graph Neural Networks AAAI 2021
- Towards Self-Explainable Graph Neural Network Towards Self-Explainable Graph Neural Network
- IJCAI 2021: Understanding Structural Vulnerability in Graph Convolutional Networks Understanding Structural Vulnerability in Graph Convolutional Networks IJCAI 2021
- ICML 2021: GRAND: Graph Neural Diffusion GRAND: Graph Neural Diffusion ICML 2021
- Probing GNN Explainers: A Rigorous Theoretical and Empirical Analysis of GNN Explanation Methods Probing GNN Explainers: A Rigorous Theoretical and Empirical Analysis of GNN Explanation Methods
- Training Robust Graph Neural Networks with Topology Adaptive Edge Dropping Training Robust Graph Neural Networks with Topology Adaptive Edge Dropping
- GraphTheta: A Distributed Graph Neural Network Learning System With Flexible Training Strategy GraphTheta: A Distributed Graph Neural Network Learning System With Flexible Training Strategy
- ICLR 2021: AutoGL: A Library for Automated Graph Learning AutoGL: A Library for Automated Graph Learning ICLR 2021
- WWW 2021: SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling WWW 2021
- Bag of Tricks for Node Classification with Graph Neural Networks Bag of Tricks for Node Classification with Graph Neural Networks
- Adversarial Graph Disentanglement with Component-specific Aggregation Adversarial Graph Disentanglement with Component-specific Aggregation
- ICML 2021: Graph Neural Networks Inspired by Classical Iterative Algorithms Graph Neural Networks Inspired by Classical Iterative Algorithms ICML 2021
- WWW 2021: Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework WWW 2021
- ICML 2021: How Framelets Enhance Graph Neural Networks How Framelets Enhance Graph Neural Networks ICML 2021
- NeurIPS 2021: Learning Conjoint Attentions for Graph Neural Nets Learning Conjoint Attentions for Graph Neural Nets NeurIPS 2021
- TMLR 2021: Calibrating and Improving Graph Contrastive Learning Calibrating and Improving Graph Contrastive Learning TMLR 2021
- IJCAI 2020: Rethinking the Promotion Brought by Contrastive Learning to Semi-Supervised Node Classification Rethinking the Promotion Brought by Contrastive Learning to Semi-Supervised Node Classification IJCAI 2020
- Learning to Drop: Robust Graph Neural Network via Topological Denoising Learning to Drop: Robust Graph Neural Network via Topological Denoising
- NeurIPS 2020: Scalable Graph Neural Networks via Bidirectional Propagation Scalable Graph Neural Networks via Bidirectional Propagation NeurIPS 2020
- Bi-GCN: Binary Graph Convolutional Network Bi-GCN: Binary Graph Convolutional Network
- IJCAI 2020: Multi-hop Attention Graph Neural Networks Multi-hop Attention Graph Neural Networks IJCAI 2020
- Learned Low Precision Graph Neural Networks Learned Low Precision Graph Neural Networks
- AAAI 2020: Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learning Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learning AAAI 2020
- AAAI 2020: Rethinking Graph Regularization for Graph Neural Networks Rethinking Graph Regularization for Graph Neural Networks AAAI 2020
- AAAI 2020: SAIL: Self-Augmented Graph Contrastive Learning SAIL: Self-Augmented Graph Contrastive Learning AAAI 2020
- Tackling Over-Smoothing for General Graph Convolutional Networks Tackling Over-Smoothing for General Graph Convolutional Networks
- Self-supervised Learning on Graphs: Deep Insights and New Directions Self-supervised Learning on Graphs: Deep Insights and New Directions
- ICML 2020: When Does Self-Supervision Help Graph Convolutional Networks? When Does Self-Supervision Help Graph Convolutional Networks? ICML 2020
- Understanding and Resolving Performance Degradation in Deep Graph Convolutional Networks Understanding and Resolving Performance Degradation in Deep Graph Convolutional Networks
- NeurIPS 2020: Towards Deeper Graph Neural Networks with Differentiable Group Normalization Towards Deeper Graph Neural Networks with Differentiable Group Normalization NeurIPS 2020
- NeurIPS 2020: Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks Scattering GCN: Overcoming Oversmoothness in Graph Convolutional Networks NeurIPS 2020
- Spectral Graph Attention Network with Fast Eigen-approximation Spectral Graph Attention Network with Fast Eigen-approximation
- Graph-Bert: Only Attention is Needed for Learning Graph Representations Graph-Bert: Only Attention is Needed for Learning Graph Representations
- AAAI 2019: Graph Neural Ordinary Differential Equations Graph Neural Ordinary Differential Equations AAAI 2019
- NeurIPS 2019: Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks NeurIPS 2019
- ICLR 2019: GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding ICLR 2019
- GraphMix: Improved Training of GNNs for Semi-Supervised Learning GraphMix: Improved Training of GNNs for Semi-Supervised Learning
- Multi-Scale Attributed Node Embedding Multi-Scale Attributed Node Embedding
- Auto-GNN: Neural Architecture Search of Graph Neural Networks Auto-GNN: Neural Architecture Search of Graph Neural Networks
- IJCAI 2019: SPAGAN: Shortest Path Graph Attention Network SPAGAN: Shortest Path Graph Attention Network IJCAI 2019
- Fast Haar Transforms for Graph Neural Networks Fast Haar Transforms for Graph Neural Networks
- Pre-Training Graph Neural Networks for Generic Structural Feature Extraction Pre-Training Graph Neural Networks for Generic Structural Feature Extraction
- AAAI 2019: Power up! Robust Graph Convolutional Network via Graph Powering Power up! Robust Graph Convolutional Network via Graph Powering AAAI 2019
- Graph U-Nets Graph U-Nets
- ICLR 2019: Fast Graph Representation Learning with PyTorch Geometric Fast Graph Representation Learning with PyTorch Geometric ICLR 2019
- Graph Neural Networks With Convolutional ARMA Filters Graph Neural Networks With Convolutional ARMA Filters
- A Comprehensive Survey on Graph Neural Networks A Comprehensive Survey on Graph Neural Networks
- Deep Learning on Graphs: A Survey Deep Learning on Graphs: A Survey
- AAAI 2018: Bayesian graph convolutional neural networks for semi-supervised classification Bayesian graph convolutional neural networks for semi-supervised classification AAAI 2018
- ICLR 2018: Predict then Propagate: Graph Neural Networks meet Personalized PageRank Predict then Propagate: Graph Neural Networks meet Personalized PageRank ICLR 2018
- Attention-based Graph Neural Network for Semi-supervised Learning Attention-based Graph Neural Network for Semi-supervised Learning
- ICLR 2017: Graph Attention Networks Graph Attention Networks ICLR 2017
- Topology Adaptive Graph Convolutional Networks Topology Adaptive Graph Convolutional Networks
- Geometric deep learning on graphs and manifolds using mixture model CNNs Geometric deep learning on graphs and manifolds using mixture model CNNs
Node classification on one citation graph, predicting one of three diabetes-related paper classes from TF-IDF features and citations. Evaluated by Accuracy.
Dataset details
Task
Citation network node classification (3 classes). The primary catalog metric is Accuracy.
Data
Citation network node classification (3 classes).
Features
The representation follows the cited PyG loader or benchmark release. Node and edge fields are dataset-specific; preprocessing, graph direction, and any feature normalization must be kept fixed when reproducing a result.
Splits and evaluation
The catalog records these protocols or variants: Planetoid split. Evaluation uses Accuracy (higher is better). Exact masks or folds must come from the cited release.
Quirks and pitfalls
The same short dataset name is used for incompatible processed artifacts and split protocols. Report the loader/version, directedness, feature preprocessing, and exact masks; transductive results should not be described as inductive.
Sources
Yang et al. 2016 fixed split.
SOTA Progression
new SOTA
matches SOTA at that time
other proposed result
other baseline result
Leaderboard
| # | Model | Accuracy ↑ | F1 | F1-macro | F1-micro | Instability | Ma-F1 | Micro-F1 | Prediction Acc. | Unfaithfulness | Paper |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 1 | LGTL | 0.9518
±
0.0011 | — | — | — | — | — | — | — | — | |
| 2 | MixHop (LO) | 0.9513
±
0.0038 | — | — | — | — | — | — | — | — | |
| 3 | GraphSAGE (LO) | 0.9511
±
0.0036 | — | — | — | — | — | — | — | — | |
| 4 | MLP (LO) | 0.9505
±
0.0036 | — | — | — | — | — | — | — | — | |
| 5 | LLAGA-HO | 0.9503
±
0.0012 | — | — | — | — | — | — | — | — | |
| 6 | LLAGA-ND | 0.9503
±
0.0014 | — | — | — | — | — | — | — | — | |
| 7 | NodeFormer | 0.9490
±
0.0019 | — | — | — | — | — | — | — | — | |
| 8 | PromptGFM | 0.9465 | — | — | — | — | — | — | — | — | |
| 9 | Flan-T5-large | 0.9462
±
0.0013 | — | — | — | — | — | — | — | — | |
| 10 | GAGA | 0.9462
±
0.0020 | — | — | — | — | — | — | — | — | |
| 11 | Flan-T5-base | 0.9445
±
0.0012 | — | — | — | — | — | — | — | — | |
| 12 | TAPE | 0.9431
±
0.0015 | — | — | — | — | — | — | — | — | |
| 13 | GCN (LO) | 0.9396
±
0.0030 | — | — | — | — | — | — | — | — | |
| 14 | Llama-7b | 0.9384
±
0.0025 | — | — | — | — | — | — | — | — | |
| 15 | InstructGLM | 0.9384
±
0.0015 | — | — | — | — | — | — | — | — | |
| 16 | H2GCN | 0.9361
±
0.0013 | — | — | — | — | — | — | — | — | |
| 17 | APPNP | 0.9355
±
0.0060 | — | — | — | — | — | — | — | — | |
| 18 | GCN | 0.9296
±
0.0015 | — | — | — | — | — | — | — | — | |
| 19 | GLEM | 0.9257
±
0.0020 | — | — | — | — | — | — | — | — | |
| 20 | GAT | 0.9233
±
0.0018 | — | — | — | — | — | — | — | — | |
| 21 | Policy-GNN | 0.9210
±
0.0220 | — | — | — | — | — | — | — | — | |
| 22 | SSP | 0.9178
±
0.0116 | — | — | — | — | — | — | — | — | |
| 23 | NE-ASGCN | 0.9170
±
0.0015 | — | — | — | — | — | — | — | — | |
| 24 | JKNet | 0.9160 | — | — | — | — | — | — | — | — | |
| 25 | JKNet+DropEdge | 0.9160 | — | — | — | — | — | — | — | — | |
| 26 | TADropEdge-CDF | 0.9150 | — | — | — | — | — | — | — | — | |
| 27 | TADropEdge-GCN | 0.9150 | — | — | — | — | — | — | — | — | |
| 28 | Snowball-V3 | 0.9144
±
0.0059 | — | — | — | — | — | — | — | — | |
| 29 | ACM-Snowball-3 | 0.9140
±
0.0040 | — | — | — | — | — | — | — | — | |
| 30 | GCN-b | 0.9130 | — | — | — | — | — | — | — | — | |
| 31 | GCN-b+DropEdge | 0.9130 | — | — | — | — | — | — | — | — | |
| 32 | TADropEdge-Cutoff | 0.9120 | — | — | — | — | — | — | — | — | |
| 33 | TADropEdge-Division | 0.9120 | — | — | — | — | — | — | — | — | |
| 34 | TADropEdge-JKNet | 0.9110 | — | — | — | — | — | — | — | — | |
| 35 | TADropEdge-IncepGCN | 0.9110 | — | — | — | — | — | — | — | — | |
| 36 | ResGCN | 0.9110 | — | — | — | — | — | — | — | — | |
| 37 | ResGCN+DropEdge | 0.9110 | — | — | — | — | — | — | — | — | |
| 38 | N2N-TAPS-1 (JL) | 0.9108
±
0.0016 | — | — | — | — | — | — | — | — | |
| 39 | contrastive loss | 0.9104 | — | — | — | — | — | — | — | — | |
| 40 | GCN+DropEdge | 0.9100 | — | — | — | — | — | — | — | — | |
| 41 | ACM-GCN | 0.9096
±
0.0062 | — | — | — | — | — | — | — | — | |
| 42 | N2N | 0.9092
±
0.0009 | — | — | — | — | — | — | — | — | |
| 43 | DropEdge | 0.9090 | — | — | — | — | — | — | — | — | |
| 44 | N2N-TAPS-4 (JL) | 0.9078
±
0.0007 | — | — | — | — | — | — | — | — | |
| 45 | N2N-TAPS-5 (JL) | 0.9078
±
0.0020 | — | — | — | — | — | — | — | — | |
| 46 | N2N-TAPS-2 (JL) | 0.9076
±
0.0014 | — | — | — | — | — | — | — | — | |
| 47 | N2N-TAPS-3 (JL) | 0.9074
±
0.0005 | — | — | — | — | — | — | — | — | |
| 48 | NE-SAGE | 0.9070
±
0.0098 | — | — | — | — | — | — | — | — | |
| 49 | APPNP+DropEdge | 0.9070 | — | — | — | — | — | — | — | — | |
| 50 | origin-ASGCN | 0.9060
±
0.0016 | — | — | — | — | — | — | — | — |
SOTA performance
set a new SOTA at the time
matched the SOTA at the time