{"task":"Graph Classification","dataset":"REDDIT-B","metric_names":["Accuracy","Accuracy (10-fold)"],"rows":[{"id":95432,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"CRaWl","metrics":{"Accuracy":"93.15"},"paper_url":"https://arxiv.org/abs/2102.08786v3","paper_title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","paper_date":"2021-02-17","code_links":[{"title":"toenshoff/CRaWl","url":"https://github.com/toenshoff/CRaWl"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95433,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"92.57"},"paper_url":"https://arxiv.org/abs/1907.02204v4","paper_title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","paper_date":"2019-07-04","code_links":[{"title":"zetayue/CPA","url":"https://github.com/zetayue/CPA"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95434,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"GIN-0","metrics":{"Accuracy":"92.4"},"paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","paper_date":"2018-10-01","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95435,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"DiffPool","metrics":{"Accuracy":"92.1"},"paper_url":"http://arxiv.org/abs/1903.02428v3","paper_title":"Fast Graph Representation Learning with PyTorch Geometric","paper_date":"2019-03-06","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"leojklarner/gauche","url":"https://github.com/leojklarner/gauche"},{"title":"ncfrey/litmatter","url":"https://github.com/ncfrey/litmatter"},{"title":"long-9621/splinecnn","url":"https://github.com/long-9621/splinecnn"},{"title":"luxtu/OCTA-graph","url":"https://github.com/luxtu/OCTA-graph"},{"title":"NMADALI97/French-web-domain-classification","url":"https://github.com/NMADALI97/French-web-domain-classification"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95436,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"WEGL","metrics":{"Accuracy":"92"},"paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","paper_date":"2020-06-16","code_links":[{"title":"navid-naderi/WEGL","url":"https://github.com/navid-naderi/WEGL"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95437,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"Local Topological Profile (LTP)","metrics":{"Accuracy":"91.1 ± 1.0","Accuracy (10-fold)":"91.1 ± 1.0"},"paper_url":"https://arxiv.org/abs/2305.00724v1","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_date":"2023-05-01","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95438,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"2-WL-GNN","metrics":{"Accuracy":"89.4"},"paper_url":"https://arxiv.org/abs/2007.00346v2","paper_title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","paper_date":"2020-07-01","code_links":[{"title":"Cortys/master-thesis","url":"https://github.com/Cortys/master-thesis"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95439,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"δ-2-LWL","metrics":{"Accuracy":"89.0"},"paper_url":"https://arxiv.org/abs/1904.01543v3","paper_title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","paper_date":"2019-04-02","code_links":[{"title":"chrsmrrs/sparsewl","url":"https://github.com/chrsmrrs/sparsewl"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95440,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"NDP","metrics":{"Accuracy":"84.3"},"paper_url":"https://arxiv.org/abs/1910.11436v3","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_date":"2019-10-24","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95441,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"GraphSAGE","metrics":{"Accuracy":"84.3"},"paper_url":"https://arxiv.org/abs/1912.09893v3","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","paper_date":"2019-12-20","code_links":[{"title":"diningphil/gnn-comparison","url":"https://github.com/diningphil/gnn-comparison"},{"title":"diningphil/CGMM","url":"https://github.com/diningphil/CGMM"},{"title":"FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks","url":"https://github.com/FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"},{"title":"diningphil/icgmm","url":"https://github.com/diningphil/icgmm"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95442,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"ApproxRepSet","metrics":{"Accuracy":"80.3"},"paper_url":"https://arxiv.org/abs/1904.01962v2","paper_title":"Rep the Set: Neural Networks for Learning Set Representations","paper_date":"2019-04-03","code_links":[{"title":"giannisnik/repset","url":"https://github.com/giannisnik/repset"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":95443,"task":"Graph Classification","parent_task":null,"dataset":"REDDIT-B","model_name":"Graph-JEPA","metrics":{"Accuracy":"56.73"},"paper_url":"https://arxiv.org/abs/2309.16014v3","paper_title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","paper_date":"2023-09-27","code_links":[{"title":"geriskenderi/graph-jepa","url":"https://github.com/geriskenderi/graph-jepa"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122201,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"CRaWl","metrics":{"Accuracy":"93.15"},"paper_url":"https://arxiv.org/abs/2102.08786v3","paper_title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","paper_date":"2021-02-17","code_links":[{"title":"toenshoff/CRaWl","url":"https://github.com/toenshoff/CRaWl"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122202,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"GAT-GC (f-Scaled)","metrics":{"Accuracy":"92.57"},"paper_url":"https://arxiv.org/abs/1907.02204v4","paper_title":"Improving Attention Mechanism in Graph Neural Networks via Cardinality Preservation","paper_date":"2019-07-04","code_links":[{"title":"zetayue/CPA","url":"https://github.com/zetayue/CPA"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122203,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"GIN-0","metrics":{"Accuracy":"92.4"},"paper_url":"http://arxiv.org/abs/1810.00826v3","paper_title":"How Powerful are Graph Neural Networks?","paper_date":"2018-10-01","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/gin"},{"title":"weihua916/powerful-gnns","url":"https://github.com/weihua916/powerful-gnns"},{"title":"lukecavabarrett/pna","url":"https://github.com/lukecavabarrett/pna"},{"title":"gospodima/extended-simgnn","url":"https://github.com/gospodima/extended-simgnn"},{"title":"calciver/Graph-Isomorphism-Networks","url":"https://github.com/calciver/Graph-Isomorphism-Networks"},{"title":"yuwvandy/g2gnn","url":"https://github.com/yuwvandy/g2gnn"},{"title":"PurdueMINDS/RelationalPooling","url":"https://github.com/PurdueMINDS/RelationalPooling"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric/blob/main/haiku_geometric/nn/conv/gin_conv.py"},{"title":"karolismart/dropgnn","url":"https://github.com/karolismart/dropgnn"},{"title":"egyptdj/graph-neural-mapping","url":"https://github.com/egyptdj/graph-neural-mapping"},{"title":"guillaumejaume/tuto-dl-on-graphs","url":"https://github.com/guillaumejaume/tuto-dl-on-graphs"},{"title":"pfnet-research/treewidth-prediction","url":"https://github.com/pfnet-research/treewidth-prediction"},{"title":"gmum/umwpl2021","url":"https://github.com/gmum/umwpl2021"},{"title":"zhliping/Deep-Learning","url":"https://github.com/zhliping/Deep-Learning"},{"title":"k4my4r/ECG-Classification","url":"https://github.com/k4my4r/ECG-Classification"},{"title":"igorsterner/commute-opt-gnn","url":"https://github.com/igorsterner/commute-opt-gnn"},{"title":"mfmceneaney/Lambda-GNNs","url":"https://github.com/mfmceneaney/Lambda-GNNs"},{"title":"willy-b/tiny-GIN-for-ogbg-molhiv","url":"https://github.com/willy-b/tiny-GIN-for-ogbg-molhiv"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122204,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"DiffPool","metrics":{"Accuracy":"92.1"},"paper_url":"http://arxiv.org/abs/1903.02428v3","paper_title":"Fast Graph Representation Learning with PyTorch Geometric","paper_date":"2019-03-06","code_links":[{"title":"rusty1s/pytorch_geometric","url":"https://github.com/rusty1s/pytorch_geometric"},{"title":"leojklarner/gauche","url":"https://github.com/leojklarner/gauche"},{"title":"ncfrey/litmatter","url":"https://github.com/ncfrey/litmatter"},{"title":"long-9621/splinecnn","url":"https://github.com/long-9621/splinecnn"},{"title":"luxtu/OCTA-graph","url":"https://github.com/luxtu/OCTA-graph"},{"title":"NMADALI97/French-web-domain-classification","url":"https://github.com/NMADALI97/French-web-domain-classification"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122205,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"WEGL","metrics":{"Accuracy":"92"},"paper_url":"https://arxiv.org/abs/2006.09430v2","paper_title":"Wasserstein Embedding for Graph Learning","paper_date":"2020-06-16","code_links":[{"title":"navid-naderi/WEGL","url":"https://github.com/navid-naderi/WEGL"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122206,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"Local Topological Profile (LTP)","metrics":{"Accuracy":"91.1 ± 1.0","Accuracy (10-fold)":"91.1 ± 1.0"},"paper_url":"https://arxiv.org/abs/2305.00724v1","paper_title":"Strengthening structural baselines for graph classification using Local Topological Profile","paper_date":"2023-05-01","code_links":[{"title":"j-adamczyk/ltp","url":"https://github.com/j-adamczyk/ltp"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122207,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"2-WL-GNN","metrics":{"Accuracy":"89.4"},"paper_url":"https://arxiv.org/abs/2007.00346v2","paper_title":"A Novel Higher-order Weisfeiler-Lehman Graph Convolution","paper_date":"2020-07-01","code_links":[{"title":"Cortys/master-thesis","url":"https://github.com/Cortys/master-thesis"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122208,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"δ-2-LWL","metrics":{"Accuracy":"89.0"},"paper_url":"https://arxiv.org/abs/1904.01543v3","paper_title":"Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings","paper_date":"2019-04-02","code_links":[{"title":"chrsmrrs/sparsewl","url":"https://github.com/chrsmrrs/sparsewl"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122209,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"NDP","metrics":{"Accuracy":"84.3"},"paper_url":"https://arxiv.org/abs/1910.11436v3","paper_title":"Hierarchical Representation Learning in Graph Neural Networks with Node Decimation Pooling","paper_date":"2019-10-24","code_links":[{"title":"danielegrattarola/decimation-pooling","url":"https://github.com/danielegrattarola/decimation-pooling"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122210,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"GraphSAGE","metrics":{"Accuracy":"84.3"},"paper_url":"https://arxiv.org/abs/1912.09893v3","paper_title":"A Fair Comparison of Graph Neural Networks for Graph Classification","paper_date":"2019-12-20","code_links":[{"title":"diningphil/gnn-comparison","url":"https://github.com/diningphil/gnn-comparison"},{"title":"diningphil/CGMM","url":"https://github.com/diningphil/CGMM"},{"title":"FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks","url":"https://github.com/FilippoMB/Pyramidal-Reservoir-Graph-Nerual-Networks"},{"title":"diningphil/icgmm","url":"https://github.com/diningphil/icgmm"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122211,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"ApproxRepSet","metrics":{"Accuracy":"80.3"},"paper_url":"https://arxiv.org/abs/1904.01962v2","paper_title":"Rep the Set: Neural Networks for Learning Set Representations","paper_date":"2019-04-03","code_links":[{"title":"giannisnik/repset","url":"https://github.com/giannisnik/repset"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":122212,"task":"Graph Classification","parent_task":"Classification","dataset":"REDDIT-B","model_name":"Graph-JEPA","metrics":{"Accuracy":"56.73"},"paper_url":"https://arxiv.org/abs/2309.16014v3","paper_title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","paper_date":"2023-09-27","code_links":[{"title":"geriskenderi/graph-jepa","url":"https://github.com/geriskenderi/graph-jepa"}],"metrics_order":"[\"Accuracy\", \"Accuracy (10-fold)\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}