{"url":"/sota/node-classification-on-ppi","task":{"name":"Node Classification","url":"/task/node-classification","note":null},"dataset":{"name":"PPI","url":"/dataset/ppi"},"category":"Graphs","categories":["Graphs"],"category_note":null,"description":"**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.\r\n\r\n**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](/dataset/cora), [Citeseer](/dataset/citeseer), and [Pubmed](/dataset/pubmed), among others, typically using Accuracy and F1.\r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Fast Graph Representation Learning With PyTorch Geometric](https://arxiv.org/pdf/1903.02428v3.pdf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["F1","Micro-F1","Micro F1","Macro-F1"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"F1":"higher","Micro-F1":"higher","Micro F1":"higher","Macro-F1":"higher"}},"counts":{"rows":24,"rows_with_code":24,"rows_with_paper_page":24,"rows_dated":24,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"g2-MLP","metrics":{"F1":"99.71"},"uses_additional_data":false,"paper_date":"2022-07-11","paper":"/paper/a-proposal-of-multi-layer-perceptron-with","paper_url":"https://www.jstage.jst.go.jp/article/pjsai/JSAI2022/0/JSAI2022_1G4OS22a03/_article/-char/ja/","paper_title":"A Proposal of Multi-Layer Perceptron with Graph Gating Unit for Graph Representation Learning and its Application to Surrogate Model for FEM","code":"https://github.com/nnaakkaaii/g2-MLP","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"GCNII*","metrics":{"F1":"99.56"},"uses_additional_data":false,"paper_date":"2020-07-04","paper":"/paper/simple-and-deep-graph-convolutional-networks-1","paper_url":"https://arxiv.org/abs/2007.02133v1","paper_title":"Simple and Deep Graph Convolutional Networks","code":"https://github.com/chennnM/GCNII/tree/master/PyG/ogbn-arxiv","n_code_links":4,"syntology":{"n_ran":5,"n_unverified":2,"n_samples":7,"n_pointer_only_licence":4}},{"rank_in_archive_order":3,"model":"GraphSAINT","metrics":{"F1":"99.50"},"uses_additional_data":false,"paper_date":"2019-07-10","paper":"/paper/graphsaint-graph-sampling-based-inductive","paper_url":"https://arxiv.org/abs/1907.04931v4","paper_title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/graphsaint","n_code_links":8,"syntology":null},{"rank_in_archive_order":4,"model":"SGAS","metrics":{"F1":"99.46"},"uses_additional_data":false,"paper_date":"2019-11-30","paper":"/paper/sgas-sequential-greedy-architecture-search","paper_url":"https://arxiv.org/abs/1912.00195v2","paper_title":"SGAS: Sequential Greedy Architecture Search","code":"https://github.com/lightaime/sgas","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":6,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":5,"model":"DenseMRGCN-14","metrics":{"F1":"99.43"},"uses_additional_data":false,"paper_date":"2019-10-15","paper":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns","paper_url":"https://arxiv.org/abs/1910.06849v3","paper_title":"DeepGCNs: Making GCNs Go as Deep as CNNs","code":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb","n_code_links":4,"syntology":{"n_ran":1,"n_unverified":8,"n_samples":9,"n_pointer_only_licence":1}},{"rank_in_archive_order":6,"model":"ResMRGCN-28","metrics":{"F1":"99.41"},"uses_additional_data":false,"paper_date":"2019-10-15","paper":"/paper/deepgcns-making-gcns-go-as-deep-as-cnns","paper_url":"https://arxiv.org/abs/1910.06849v3","paper_title":"DeepGCNs: Making GCNs Go as Deep as CNNs","code":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb","n_code_links":4,"syntology":{"n_ran":1,"n_unverified":8,"n_samples":9,"n_pointer_only_licence":1}},{"rank_in_archive_order":7,"model":"GraphStar","metrics":{"F1":"99.4"},"uses_additional_data":false,"paper_date":"2019-06-21","paper":"/paper/graph-star-net-for-generalized-multi-task-1","paper_url":"https://arxiv.org/abs/1906.12330v1","paper_title":"Graph Star Net for Generalized Multi-Task Learning","code":"https://github.com/graph-star-team/graph_star","n_code_links":1,"syntology":{"n_ran":1,"n_unverified":5,"n_samples":6,"n_pointer_only_licence":0}},{"rank_in_archive_order":8,"model":"GCN + SAF","metrics":{"F1":"99.38 ± 0.01%"},"uses_additional_data":false,"paper_date":"2023-06-15","paper":"/paper/the-split-matters-flat-minima-methods-for","paper_url":"https://arxiv.org/abs/2306.09121v1","paper_title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","code":"https://github.com/foisunt/fmms-in-gnns","n_code_links":1,"syntology":null},{"rank_in_archive_order":9,"model":"Cluster-GCN","metrics":{"F1":"99.36"},"uses_additional_data":false,"paper_date":"2019-05-20","paper":"/paper/cluster-gcn-an-efficient-algorithm-for","paper_url":"https://arxiv.org/abs/1905.07953v2","paper_title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","code":"https://github.com/google-research/google-research","n_code_links":6,"syntology":null},{"rank_in_archive_order":10,"model":"GAT + PGN","metrics":{"F1":"99.34 ± 0.02%"},"uses_additional_data":false,"paper_date":"2023-06-15","paper":"/paper/the-split-matters-flat-minima-methods-for","paper_url":"https://arxiv.org/abs/2306.09121v1","paper_title":"The Split Matters: Flat Minima Methods for Improving the Performance of GNNs","code":"https://github.com/foisunt/fmms-in-gnns","n_code_links":1,"syntology":null},{"rank_in_archive_order":11,"model":"DSGCN","metrics":{"F1":"99.09 ± 0.03"},"uses_additional_data":false,"paper_date":"2020-03-26","paper":"/paper/bridging-the-gap-between-spectral-and-spatial","paper_url":"https://arxiv.org/abs/2003.11702v1","paper_title":"Bridging the Gap Between Spectral and Spatial Domains in Graph Neural Networks","code":"https://github.com/balcilar/Spectral-Designed-Graph-Convolutions","n_code_links":2,"syntology":null},{"rank_in_archive_order":12,"model":"GaAN","metrics":{"F1":"98.7"},"uses_additional_data":false,"paper_date":"2018-03-20","paper":"/paper/gaan-gated-attention-networks-for-learning-on","paper_url":"http://arxiv.org/abs/1803.07294v1","paper_title":"GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs","code":"https://github.com/jennyzhang0215/GaAN","n_code_links":1,"syntology":null},{"rank_in_archive_order":13,"model":"GraphNAS","metrics":{"F1":"98.6 ± 0.1"},"uses_additional_data":false,"paper_date":"2019-04-22","paper":"/paper/graphnas-graph-neural-architecture-search","paper_url":"https://arxiv.org/abs/1904.09981v2","paper_title":"GraphNAS: Graph Neural Architecture Search with Reinforcement Learning","code":"https://github.com/GraphNAS/GraphNAS-simple","n_code_links":1,"syntology":{"n_ran":0,"n_unverified":8,"n_samples":8,"n_pointer_only_licence":0}},{"rank_in_archive_order":14,"model":"JK-LSTM","metrics":{"F1":"97.6"},"uses_additional_data":false,"paper_date":"2018-06-09","paper":"/paper/representation-learning-on-graphs-with","paper_url":"http://arxiv.org/abs/1806.03536v2","paper_title":"Representation Learning on Graphs with Jumping Knowledge Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/jknet","n_code_links":5,"syntology":{"n_ran":0,"n_unverified":1,"n_samples":1,"n_pointer_only_licence":0}},{"rank_in_archive_order":15,"model":"VQ-GNN (GAT)","metrics":{"F1":"97.37"},"uses_additional_data":false,"paper_date":"2021-10-27","paper":"/paper/vq-gnn-a-universal-framework-to-scale-up","paper_url":"https://arxiv.org/abs/2110.14363v1","paper_title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","code":"https://github.com/devnkong/VQ-GNN","n_code_links":1,"syntology":null},{"rank_in_archive_order":16,"model":"GAT","metrics":{"F1":"97.3"},"uses_additional_data":false,"paper_date":"2017-10-30","paper":"/paper/graph-attention-networks","paper_url":"http://arxiv.org/abs/1710.10903v3","paper_title":"Graph Attention Networks","code":"https://github.com/labmlai/annotated_deep_learning_paper_implementations","n_code_links":93,"syntology":{"n_ran":50,"n_unverified":56,"n_samples":106,"n_pointer_only_licence":43}},{"rank_in_archive_order":17,"model":"SIGN","metrics":{"F1":"96.50"},"uses_additional_data":false,"paper_date":"2020-04-23","paper":"/paper/sign-scalable-inception-graph-neural-networks","paper_url":"https://arxiv.org/abs/2004.11198v3","paper_title":"SIGN: Scalable Inception Graph Neural Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/sign","n_code_links":5,"syntology":{"n_ran":2,"n_unverified":5,"n_samples":7,"n_pointer_only_licence":0}},{"rank_in_archive_order":18,"model":"ClusterGCN","metrics":{"F1":"92.9"},"uses_additional_data":false,"paper_date":"2019-05-20","paper":"/paper/cluster-gcn-an-efficient-algorithm-for","paper_url":"https://arxiv.org/abs/1905.07953v2","paper_title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","code":"https://github.com/google-research/google-research","n_code_links":6,"syntology":null},{"rank_in_archive_order":19,"model":"LGCN","metrics":{"F1":"77.2"},"uses_additional_data":false,"paper_date":"2018-08-12","paper":"/paper/large-scale-learnable-graph-convolutional","paper_url":"http://arxiv.org/abs/1808.03965v1","paper_title":"Large-Scale Learnable Graph Convolutional Networks","code":"https://github.com/divelab/lgcn","n_code_links":1,"syntology":null},{"rank_in_archive_order":20,"model":"GRACE","metrics":{"F1":"66.2","Micro-F1":"66.2"},"uses_additional_data":false,"paper_date":"2020-06-07","paper":"/paper/deep-graph-contrastive-representation","paper_url":"https://arxiv.org/abs/2006.04131v2","paper_title":"Deep Graph Contrastive Representation Learning","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/grace","n_code_links":3,"syntology":{"n_ran":1,"n_unverified":0,"n_samples":1,"n_pointer_only_licence":1}},{"rank_in_archive_order":21,"model":"GraphSAGE","metrics":{"F1":"61.2"},"uses_additional_data":false,"paper_date":"2017-06-07","paper":"/paper/inductive-representation-learning-on-large","paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","code":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py","n_code_links":20,"syntology":{"n_ran":3,"n_unverified":2,"n_samples":5,"n_pointer_only_licence":5}},{"rank_in_archive_order":22,"model":"PairE","metrics":{"Micro F1":"94.83"},"uses_additional_data":false,"paper_date":"2022-03-03","paper":"/paper/graph-representation-learning-beyond-node-and","paper_url":"https://arxiv.org/abs/2203.01564v1","paper_title":"Graph Representation Learning Beyond Node and Homophily","code":"https://github.com/syvail/PairE-Graph-Representation-Learning-Beyond-Node-and-Homophily","n_code_links":1,"syntology":null},{"rank_in_archive_order":23,"model":"node2vec","metrics":{"Macro-F1":"0.1791"},"uses_additional_data":false,"paper_date":"2016-07-03","paper":"/paper/node2vec-scalable-feature-learning-for","paper_url":"http://arxiv.org/abs/1607.00653v1","paper_title":"node2vec: Scalable Feature Learning for Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/node2vec","n_code_links":20,"syntology":{"n_ran":8,"n_unverified":17,"n_samples":25,"n_pointer_only_licence":3}},{"rank_in_archive_order":24,"model":"DeepWalk","metrics":{"Macro-F1":"0.1768"},"uses_additional_data":false,"paper_date":"2016-07-03","paper":"/paper/node2vec-scalable-feature-learning-for","paper_url":"http://arxiv.org/abs/1607.00653v1","paper_title":"node2vec: Scalable Feature Learning for Networks","code":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/node2vec","n_code_links":20,"syntology":{"n_ran":8,"n_unverified":17,"n_samples":25,"n_pointer_only_licence":3}}],"since_archive":{"present":false,"note":"No Syntology-extracted rows are published in this build."},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":13,"rows_with_any_sample_ran":11,"distinct_papers_with_graph_line":11,"distinct_papers_with_any_sample_ran":9,"samples_over_distinct_papers":{"n_ran":72,"n_unverified":110,"n_samples":182,"n_pointer_only_licence":57,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":81,"n_unverified":135,"n_samples":216,"n_pointer_only_licence":61,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}