Browse State-of-the-Art › Node Classification

Node Classification

991 papers with code · 138 benchmarks · 75 datasets archive 2025-07-28

Graphs

Node Classification is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.

Node Classification models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like Cora, Citeseer, and Pubmed, among others, typically using Accuracy and F1.

( Image credit: Fast Graph Representation Learning With PyTorch Geometric )

Description from the archive archive 2025-07-28; Papers-with-Code links inside it are rewritten to this site.

Benchmarks archive 2025-07-28

138 leaderboard tables shown for this task, 138 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted. 10 shown of 138 until expanded.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
Cora (73 rows) SSP Optimization of Graph Neural Networks with Natural Gradient Descent code — Compare
Citeseer (71 rows) ACMII-Snowball-2 Is Heterophily A Real Nightmare For Graph Neural Networks To Do... — — Compare
Pubmed (70 rows) NCGCN Clarify Confused Nodes via Separated Learning code — Compare
Wisconsin (63 rows) 5-HiGCN Higher-order Graph Convolutional Network with Flower-Petals... code Syntology ran 1 of 1 samples · 0 unverified Compare
Actor (62 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Texas (62 rows) RDGNN-S Graph Neural Reaction Diffusion Models — — Compare
Chameleon (61 rows) DJ-GNN Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters code Syntology ran 1 of 1 samples · 0 unverified Compare
Cornell (60 rows) RDGNN-I Graph Neural Reaction Diffusion Models — — Compare
Squirrel (59 rows) FaberNet HoloNets: Spectral Convolutions do extend to Directed Graphs code Syntology ran 4 of 5 samples · 1 unverified Compare
CiteSeer with Public Split: fixed 20 nodes per class (40 rows) OGC From Cluster Assumption to Graph Convolution: Graph-based... code — Compare
Chameleon (60%/20%/20% random splits) (38 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Film (60%/20%/20% random splits) (37 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
PubMed (60%/20%/20% random splits) (37 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
PubMed with Public Split: fixed 20 nodes per class (37 rows) OGC From Cluster Assumption to Graph Convolution: Graph-based... code — Compare
Squirrel (60%/20%/20% random splits) (37 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Cora with Public Split: fixed 20 nodes per class (36 rows) OGC From Cluster Assumption to Graph Convolution: Graph-based... code — Compare
Cornell (60%/20%/20% random splits) (36 rows) ACMII-GCN Revisiting Heterophily For Graph Neural Networks code Syntology ran 2 of 7 samples · 5 unverified Compare
Texas (60%/20%/20% random splits) (36 rows) ACM-GCN++ Revisiting Heterophily For Graph Neural Networks code Syntology ran 2 of 7 samples · 5 unverified Compare
Wisconsin (60%/20%/20% random splits) (35 rows) ACM-GCN++ Revisiting Heterophily For Graph Neural Networks code Syntology ran 2 of 7 samples · 5 unverified Compare
CiteSeer (60%/20%/20% random splits) (33 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Cora (60%/20%/20% random splits) (33 rows) GNNDLD GNNDLD: Graph Neural Network with Directional Label Distribution — — Compare
Penn94 (32 rows) Dual-Net GNN Feature Selection: Key to Enhance Node Classification with Graph... code — Compare
Citeseer (48%/32%/20% fixed splits) (26 rows) Geom-GCN Geom-GCN: Geometric Graph Convolutional Networks code Syntology ran 7 of 7 samples · 0 unverified Compare
Cora (48%/32%/20% fixed splits) (26 rows) NLGAT Non-Local Graph Neural Networks code Syntology ran 3 of 3 samples · 0 unverified Compare
genius (26 rows) Dual-Net GNN Feature Selection: Key to Enhance Node Classification with Graph... code — Compare
PubMed (48%/32%/20% fixed splits) (26 rows) GCNII Simple and Deep Graph Convolutional Networks code Syntology ran 5 of 7 samples · 2 unverified Compare
Coauthor CS (24 rows) NCGCN Clarify Confused Nodes via Separated Learning code — Compare
PPI (24 rows) g2-MLP A Proposal of Multi-Layer Perceptron with Graph Gating Unit for... code — Compare
PascalVOC-SP (21 rows) NeuralWalker Learning Long Range Dependencies on Graphs via Random Walks code Syntology ran 13 of 13 samples · 0 unverified Compare
COCO-SP (19 rows) NeuralWalker Learning Long Range Dependencies on Graphs via Random Walks code Syntology ran 13 of 13 samples · 0 unverified Compare
Reddit (16 rows) BNS-GCN BNS-GCN: Efficient Full-Graph Training of Graph Convolutional... code — Compare
Cora (0.5%) (15 rows) CPF-ind_APPNP Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology ran 2 of 3 samples · 1 unverified Compare
Cora (1%) (15 rows) CPF-ind-APPNP Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology ran 2 of 3 samples · 1 unverified Compare
Cora (3%) (15 rows) CPF-tra-GCNII Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology ran 2 of 3 samples · 1 unverified Compare
AMZ Photo (14 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
CiteSeer (0.5%) (14 rows) MT-GCN Mutual Teaching for Graph Convolutional Networks code — Compare
CiteSeer (1%) (14 rows) VCHN View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes code — Compare
Coauthor Physics (14 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
PubMed (0.03%) (14 rows) VCHN View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes code — Compare
PubMed (0.05%) (14 rows) VCHN View-Consistent Heterogeneous Network on Graphs With Few Labeled Nodes code — Compare
PubMed (0.1%) (14 rows) Truncated Krylov Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks code Syntology ran 1 of 9 samples · 8 unverified Compare
Amazon Computers (12 rows) GAT Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology ran 2 of 9 samples · 7 unverified Compare
arXiv-year (12 rows) MRS-Dir-GNN Preventing Representational Rank Collapse in MPNNs by Splitting... code — Compare
CLUSTER (12 rows) GRIT Graph Inductive Biases in Transformers without Message Passing code Syntology ran 6 of 12 samples · 6 unverified Compare
Amazon Photo (11 rows) GraphSAGE Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology ran 2 of 9 samples · 7 unverified Compare
PATTERN (11 rows) CKGCN CKGConv: General Graph Convolution with Continuous Kernels code Syntology ran 8 of 11 samples · 3 unverified Compare
Cora: fixed 20 node per class (9 rows) DSGCN Bridging the Gap Between Spectral and Spatial Domains in Graph... code — Compare
Cora Full-supervised (9 rows) GCNII Simple and Deep Graph Convolutional Networks code Syntology ran 5 of 7 samples · 2 unverified Compare
PATTERN 100k (9 rows) EGT Global Self-Attention as a Replacement for Graph Convolution code Syntology ran 0 of 4 samples · 4 unverified Compare
Yelp-Fraud (9 rows) LEX-GNN LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection code — Compare
AM (8 rows) BoP From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis code — Compare
Facebook (8 rows) GNNMoE(GCN-like P) Mixture of Experts Meets Decoupled Message Passing: Towards... code — Compare
Flickr (8 rows) GCN+GAugM (Zhao et al., 2021) Data Augmentation for Graph Neural Networks code Syntology ran 1 of 1 samples · 0 unverified Compare
AIFB (7 rows) R-GCN Modeling Relational Data with Graph Convolutional Networks code Syntology ran 10 of 32 samples · 22 unverified Compare
AMZ Comp (7 rows) HH-GCN Half-Hop: A graph upsampling approach for slowing down message passing code Syntology ran 0 of 1 samples · 1 unverified Compare
BGS (7 rows) SCENE SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph... code — Compare
Brazil Air-Traffic (7 rows) UGT Transitivity-Preserving Graph Representation Learning for Bridging... code Syntology ran 5 of 26 samples · 21 unverified Compare
Citeseer Full-supervised (7 rows) IncepGCN+DropEdge DropEdge: Towards Deep Graph Convolutional Networks on Node Classification code Syntology ran 0 of 5 samples · 5 unverified Compare
Europe Air-Traffic (7 rows) UGT Transitivity-Preserving Graph Representation Learning for Bridging... code Syntology ran 5 of 26 samples · 21 unverified Compare
pokec (7 rows) NeuralWalker Learning Long Range Dependencies on Graphs via Random Walks code Syntology ran 13 of 13 samples · 0 unverified Compare
Pubmed Full-supervised (7 rows) GraphSAGE+DropEdge DropEdge: Towards Deep Graph Convolutional Networks on Node Classification code Syntology ran 0 of 5 samples · 5 unverified Compare
roman-empire (7 rows) Polynormer Polynormer: Polynomial-Expressive Graph Transformer in Linear Time code Syntology ran 5 of 8 samples · 3 unverified Compare
USA Air-Traffic (7 rows) UGT Transitivity-Preserving Graph Representation Learning for Bridging... code Syntology ran 5 of 26 samples · 21 unverified Compare
Amazon-Fraud (6 rows) LEX-GNN LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection code — Compare
BlogCatalog (6 rows) ISNE Unsupervised Graph Representation Learning with Inductive Shallow... code — Compare
DBLP (6 rows) GRACE Deep Graph Contrastive Representation Learning code Syntology ran 1 of 1 samples · 0 unverified Compare
MUTAG (6 rows) BoP From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis code — Compare
Wiki-CS (6 rows) CGT Mitigating Degree Biases in Message Passing Mechanism by Utilizing... code — Compare
Wiki-Vote (6 rows) DEMO-Net(weight) DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph... code — Compare
Wikipedia (6 rows) GraphGAN GraphGAN: Graph Representation Learning with Generative Adversarial Nets code — Compare
AMZ Computers (5 rows) NCGCN Clarify Confused Nodes via Separated Learning code — Compare
Eximtradedata (5 rows) Struc2vec struc2vec: Learning Node Representations from Structural Identity code Syntology ran 3 of 3 samples · 0 unverified Compare
Cora Full (5 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Log Angeles (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks code Syntology ran 1 of 1 samples · 0 unverified Compare
London (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks code Syntology ran 1 of 1 samples · 0 unverified Compare
Paris (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks code Syntology ran 1 of 1 samples · 0 unverified Compare
Placenta (5 rows) GraphSAGE A New Graph Node Classification Benchmark: Learning Structure from... code Syntology ran 0 of 3 samples · 3 unverified Compare
Shanghai (5 rows) IM-GCN Improving the Effective Receptive Field of Message-Passing Neural Networks code Syntology ran 1 of 1 samples · 0 unverified Compare
amazon-ratings (4 rows) GAT Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology ran 2 of 9 samples · 7 unverified Compare
AVA (4 rows) ASDNet [ASDNet_ICCV2021] Learning Long-Term Spatial-Temporal Graphs for Active Speaker Detection code — Compare
Chameleon (48%/32%/20% fixed splits) (4 rows) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology ran 3 of 10 samples · 7 unverified Compare
Cora Full with Public Split (4 rows) CoLinkDist Distilling Self-Knowledge From Contrastive Links to Classify Graph... code Syntology ran 0 of 1 samples · 1 unverified Compare
MAG-scholar-C (4 rows) FastGCN GRAND+: Scalable Graph Random Neural Networks code — Compare
MAG240M-LSC (4 rows) R-GraphSAGE (NS) OGB-LSC: A Large-Scale Challenge for Machine Learning on Graphs code — Compare
minesweeper (4 rows) GCN Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification code Syntology ran 2 of 9 samples · 7 unverified Compare
MuMiN-large (4 rows) HeteroGraphSAGE MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked... code Syntology ran 0 of 2 samples · 2 unverified Compare
MuMiN-medium (4 rows) HeteroGraphSAGE MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked... code Syntology ran 0 of 2 samples · 2 unverified Compare
MuMiN-small (4 rows) LaBSE MuMiN: A Large-Scale Multilingual Multimodal Fact-Checked... code Syntology ran 0 of 2 samples · 2 unverified Compare
NELL (4 rows) DFNet-ATT DFNets: Spectral CNNs for Graphs with Feedback-Looped Filters code Syntology ran 0 of 2 samples · 2 unverified Compare
Squirrel (48%/32%/20% fixed splits) (4 rows) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology ran 3 of 10 samples · 7 unverified Compare
tolokers (4 rows) Polynormer Polynormer: Polynomial-Expressive Graph Transformer in Linear Time code Syntology ran 5 of 8 samples · 3 unverified Compare
Cornell (48%/32%/20% fixed splits) (3 rows) GREAD-AC GREAD: Graph Neural Reaction-Diffusion Networks code Syntology ran 3 of 10 samples · 7 unverified Compare
MS ACADEMIC (3 rows) APPNP Predict then Propagate: Graph Neural Networks meet Personalized PageRank code Syntology ran 1 of 12 samples · 11 unverified Compare
questions (3 rows) NID Node Identifiers: Compact, Discrete Representations for Efficient... code Syntology ran 10 of 13 samples · 3 unverified Compare
AMPLUS (2 rows) RR-GCN-PPV R-GCN: The R Could Stand for Random code — Compare
Chameleon(60%/20%/20% random splits) (2 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Citeseer: fixed 20 node per class (2 rows) SDSS-GAT Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
Coauthor Phy (2 rows) GCN-LPA Unifying Graph Convolutional Neural Networks and Label Propagation code Syntology ran 2 of 14 samples · 12 unverified Compare
Cora: fixed 10 node per class (2 rows) CPF-tra-GCNII Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology ran 2 of 3 samples · 1 unverified Compare
Cora: fixed 5 node per class (2 rows) CPF-tra-APPNP Extract the Knowledge of Graph Neural Networks and Go Beyond it:... code Syntology ran 2 of 3 samples · 1 unverified Compare
Crocodile (2 rows) LW-GCN Label-Wise Graph Convolutional Network for Heterophilic Graphs code — Compare
Deezer Romania (2 rows) PairE Graph Representation Learning Beyond Node and Homophily code — Compare
DMG777K (2 rows) RR-GCN-PPV R-GCN: The R Could Stand for Random code — Compare
DMGFULL (2 rows) RR-GCN-PPV R-GCN: The R Could Stand for Random code — Compare
MDGENRE (2 rows) R-GCN R-GCN: The R Could Stand for Random code — Compare
Squirrel(60%/20%/20% random splits) (2 rows) NCSAGE Clarify Confused Nodes via Separated Learning code — Compare
Telegram (Directed Graph label rate 60%) (2 rows) ScaleNet Scale Invariance of Graph Neural Networks code — Compare
Texas (48%/32%/20% fixed splits) (2 rows) GREAD-F GREAD: Graph Neural Reaction-Diffusion Networks code Syntology ran 3 of 10 samples · 7 unverified Compare
twitch-gamers (2 rows) Dual-Net GNN Feature Selection: Key to Enhance Node Classification with Graph... code — Compare
Wiki (2 rows) DANMF Deep Autoencoder-like Nonnegative Matrix Factorization for... code — Compare
wiki (2 rows) A2DUG A Simple and Scalable Graph Neural Network for Large Directed Graphs code Syntology ran 3 of 13 samples · 10 unverified Compare
Wisconsin (48%/32%/20% fixed splits) (2 rows) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology ran 3 of 10 samples · 7 unverified Compare
YouTube (2 rows) LINE GraphVite: A High-Performance CPU-GPU Hybrid System for Node Embedding code Syntology ran 0 of 7 samples · 7 unverified Compare
20NEWS (1 row) GraRep GraRep: Learning Graph Representations with Global Structural Information code — Compare
Amazon2M (1 row) Cluster-GCN Cluster-GCN: An Efficient Algorithm for Training Deep and Large... code — Compare
AMZ Computers: fixed 20 node per class (1 row) SDSS-GCN Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
BGP (1 row) PathNet Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network code — Compare
Bitcoin-Alpha (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
Bitcoin-OTC (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
CellTypeGraph Benchmark (1 row) plantcelltype-EdgeDeeperGCN CellTypeGraph: A New Geometric Computer Vision Benchmark code — Compare
CiteSeer: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Citeseer random partition (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
CiteSeer with Public Split: fixed 5 nodes per class (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
Cora: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Cora: fixed 20 nodes per class (1 row) SDSS-GCN Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
Cora random partition (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare
DBLP: 20 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
DBLP: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Deezer Croatia (1 row) GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Deezer Hungary (1 row) Smooth GEMSEC 2 GEMSEC: Graph Embedding with Self Clustering code — Compare
Electronics (1 row) PathNet Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network code — Compare
Film(48%/32%/20% fixed splits) (1 row) GREAD-BS GREAD: Graph Neural Reaction-Diffusion Networks code Syntology ran 3 of 10 samples · 7 unverified Compare
NBA (1 row) PathNet Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network code — Compare
ogbn-products (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
ogbn-products: 20 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
PubMed: 5 nodes per class (1 row) FIT-GNN FIT-GNN: Faster Inference Time for GNNs Using Coarsening code — Compare
Pubmed: fixed 20 node per class (1 row) SDSS-APPNP Multi-task Self-distillation for Graph-based Semi-Supervised Learning — — Compare
Pubmed random partition (1 row) GraphMix (GCN) GraphMix: Improved Training of GNNs for Semi-Supervised Learning code — Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

75 datasets whose archive record lists this task, ordered by the archive's paper count. 30 shown of 75 until expanded.

Subtasks archive 2025-07-28

5 subtasks in the archive's task tree.

Most implemented papers archive 2025-07-28

30 shown of 991 papers with code (1,860 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

  • 30 Oct 2017 93 repositories listed Syntology ran 50 of 106 samples · 56 unverified · 43 pointer-only (licence)
    We present graph attention networks (GATs), novel neural network architectures that operate on graph-structured data, leveraging masked self-attentional layers to address the shortcomings of prior methods based on graph…
  • 9 Sep 2016 55 repositories listed Syntology ran 31 of 58 samples · 27 unverified · 22 pointer-only (licence)
    We present a scalable approach for semi-supervised learning on graph-structured data that is based on an efficient variant of convolutional neural networks which operate directly on graphs.
  • 17 Mar 2017 27 repositories listed Syntology ran 10 of 32 samples · 22 unverified · 15 pointer-only (licence)
    We demonstrate the effectiveness of R-GCNs as a stand-alone model for entity classification.
  • 29 Mar 2016 26 repositories listed Syntology ran 15 of 28 samples · 13 unverified · 4 pointer-only (licence)
    We present a semi-supervised learning framework based on graph embeddings.
  • 7 Jun 2017 20 repositories listed Syntology ran 3 of 5 samples · 2 unverified · 5 pointer-only (licence)
    Low-dimensional embeddings of nodes in large graphs have proved extremely useful in a variety of prediction tasks, from content recommendation to identifying protein functions.
  • 4 Apr 2017 20 repositories listed Syntology ran 3 of 3 samples · 0 unverified · 1 pointer-only (licence)
    Supervised learning on molecules has incredible potential to be useful in chemistry, drug discovery, and materials science.
  • 3 Jul 2016 20 repositories listed Syntology ran 8 of 25 samples · 17 unverified · 3 pointer-only (licence)
    Taken together, our work represents a new way for efficiently learning state-of-the-art task-independent representations in complex networks.
  • 1 Oct 2018 19 repositories listed Syntology ran 3 of 10 samples · 7 unverified · 5 pointer-only (licence)
    Here, we present a theoretical framework for analyzing the expressive power of GNNs to capture different graph structures.
  • 2 Mar 2020 15 repositories listed Syntology ran 1 of 23 samples · 22 unverified
    In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs.
  • 22 Jun 2018 14 repositories listed Syntology ran 1 of 20 samples · 19 unverified
    Recently, graph neural networks (GNNs) have revolutionized the field of graph representation learning through effectively learned node embeddings, and achieved state-of-the-art results in tasks such as node…
  • 26 Mar 2014 14 repositories listed Syntology ran 2 of 3 samples · 1 unverified · 1 pointer-only (licence)
    We present DeepWalk, a novel approach for learning latent representations of vertices in a network.
  • 17 Nov 2015 13 repositories listed Syntology ran 0 of 12 samples · 12 unverified
    Graph-structured data appears frequently in domains including chemistry, natural language semantics, social networks, and knowledge bases.
  • 27 Sep 2018 11 repositories listed Syntology ran 24 of 35 samples · 11 unverified · 9 pointer-only (licence)
    We present Deep Graph Infomax (DGI), a general approach for learning node representations within graph-structured data in an unsupervised manner.
  • 26 Feb 2019 10 repositories listed Syntology ran 3 of 11 samples · 8 unverified · 1 pointer-only (licence)
    Existing approaches typically resort to node embeddings and use a recurrent neural network (RNN, broadly speaking) to regulate the embeddings and learn the temporal dynamics.
  • 22 May 2020 9 repositories listed Syntology ran 8 of 22 samples · 14 unverified
    We study the problem of semi-supervised learning on graphs, for which graph neural networks (GNNs) have been extensively explored.
  • 12 Mar 2015 9 repositories listed Syntology ran 0 of 3 samples · 3 unverified
    This paper studies the problem of embedding very large information networks into low-dimensional vector spaces, which is useful in many tasks such as visualization, node classification, and link prediction.
  • 12 Apr 2020 8 repositories listed Syntology ran 33 of 55 samples · 22 unverified · 48 pointer-only (licence)
    Graph Neural Networks (GNNs) have been shown to be effective models for different predictive tasks on graph-structured data.
  • 10 Jul 2019 8 repositories listed
    Graph Convolutional Networks (GCNs) are powerful models for learning representations of attributed graphs.
  • 30 Sep 2015 8 repositories listed Syntology ran 0 of 26 samples · 26 unverified · 1 pointer-only (licence)
    We introduce a convolutional neural network that operates directly on graphs.
  • 27 Oct 2020 7 repositories listed Syntology ran 2 of 5 samples · 3 unverified · 2 pointer-only (licence)
    Graph Neural Networks (GNNs) are the predominant technique for learning over graphs.
  • 3 Sep 2019 7 repositories listed Syntology ran 3 of 39 samples · 36 unverified · 4 pointer-only (licence)
    Advancing research in the emerging field of deep graph learning requires new tools to support tensor computation over graphs.
  • 25 Jul 2019 7 repositories listed Syntology ran 0 of 5 samples · 5 unverified
    \emph{Over-fitting} and \emph{over-smoothing} are two main obstacles of developing deep Graph Convolutional Networks (GCNs) for node classification.
  • 19 Feb 2019 7 repositories listed Syntology ran 3 of 8 samples · 5 unverified
    Graph Convolutional Networks (GCNs) and their variants have experienced significant attention and have become the de facto methods for learning graph representations.
  • 17 Mar 2021 6 repositories listed
    Enabling effective and efficient machine learning (ML) over large-scale graph data (e.
  • 19 Aug 2020 6 repositories listed Syntology ran 1 of 17 samples · 16 unverified
    Finally, the selected neighbors across different relations are aggregated together.
  • 20 May 2019 6 repositories listed
    Furthermore, Cluster-GCN allows us to train much deeper GCN without much time and memory overhead, which leads to improved prediction accuracy---using a 5-layer Cluster-GCN, we achieve state-of-the-art test F1 score 99.
  • 6 Mar 2019 6 repositories listed Syntology ran 0 of 2 samples · 2 unverified
    We introduce PyTorch Geometric, a library for deep learning on irregularly structured input data such as graphs, point clouds and manifolds, built upon PyTorch.
  • 27 Oct 2021 5 repositories listed Syntology ran 7 of 21 samples · 14 unverified · 4 pointer-only (licence)
    Many widely used datasets for graph machine learning tasks have generally been homophilous, where nodes with similar labels connect to each other.
  • 23 Apr 2020 5 repositories listed Syntology ran 2 of 7 samples · 5 unverified
    Graph representation learning has recently been applied to a broad spectrum of problems ranging from computer graphics and chemistry to high energy physics and social media.
  • 19 Feb 2020 5 repositories listed Syntology ran 0 of 1 samples · 1 unverified · 1 pointer-only (licence)
    Moreover, node and topological features can be temporal as well, whose patterns the node embeddings should also capture.

Syntology lines on 27 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections