{"task":"Link Property Prediction","dataset":"ogbl-collab","metric_names":["Test Hits@50","Ext. data","Validation Hits@50","Number of params"],"rows":[{"id":114694,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"E2N","metrics":{"Ext. data":"No","Number of params":"526851","Test Hits@50":"0.9515 ± 0.1410","Validation Hits@50":"0.9546 ± 0.1270"},"paper_url":"https://arxiv.org/abs/2311.02921v3","paper_title":"Edge2Node: Reducing Edge Prediction to Node Classification","paper_date":"2023-11-06","code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114695,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"HyperFusion","metrics":{"Ext. data":"No","Number of params":"1064446212","Test Hits@50":"0.7129 ± 0.0018","Validation Hits@50":"0.7385 ± 0.0099"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114696,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"GIDN@YITU","metrics":{"Ext. data":"No","Number of params":"60449025","Test Hits@50":"0.7096 ± 0.0055","Validation Hits@50":"0.9620 ± 0.0040"},"paper_url":"https://arxiv.org/abs/2210.01301v3","paper_title":"GIDN: A Lightweight Graph Inception Diffusion Network for High-efficient Link Prediction","paper_date":"2022-10-04","code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114697,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"PLNLP + SIGN","metrics":{"Ext. data":"No","Number of params":"34980864","Test Hits@50":"0.7087 ± 0.0033","Validation Hits@50":"1.0000 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114698,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"PLNLP (random walk aug.)","metrics":{"Ext. data":"No","Number of params":"34980864","Test Hits@50":"0.7059 ± 0.0029","Validation Hits@50":"1.0000 ± 0.0000"},"paper_url":"https://arxiv.org/abs/2112.02936v6","paper_title":"Pairwise Learning for Neural Link Prediction","paper_date":"2021-12-06","code_links":[{"title":"zhitao-wang/PLNLP","url":"https://github.com/zhitao-wang/PLNLP"},{"title":"zhitao-wang/plnlp","url":"https://github.com/zhitao-wang/plnlp"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114699,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"HOP-REC","metrics":{"Ext. data":"No","Number of params":"30191104","Test Hits@50":"0.7012 ± 0.0016","Validation Hits@50":"1.0000 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114700,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"PLNLP+ LRGA","metrics":{"Ext. data":"No","Number of params":"35200656","Test Hits@50":"0.6909 ± 0.0055","Validation Hits@50":"1.0000 ± 0.0000"},"paper_url":"https://arxiv.org/abs/2006.07846v2","paper_title":"Global Attention Improves Graph Networks Generalization","paper_date":"2020-06-14","code_links":[{"title":"omri1348/LRGA","url":"https://github.com/omri1348/LRGA"},{"title":"omri1348/LRGA","url":"https://github.com/omri1348/LRGA/tree/master/ogb/examples/linkproppred"},{"title":"chuanqichen/cs224w","url":"https://github.com/chuanqichen/cs224w"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114701,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"PLNLP (val as input)","metrics":{"Ext. data":"No","Number of params":"35112192","Test Hits@50":"0.6872 ± 0.0052","Validation Hits@50":"1.0000 ± 0.0000"},"paper_url":"https://arxiv.org/abs/2112.02936v6","paper_title":"Pairwise Learning for Neural Link Prediction","paper_date":"2021-12-06","code_links":[{"title":"zhitao-wang/PLNLP","url":"https://github.com/zhitao-wang/PLNLP"},{"title":"zhitao-wang/plnlp","url":"https://github.com/zhitao-wang/plnlp"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114702,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"Refined-GAE","metrics":{"Ext. data":"No","Number of params":"126669825","Test Hits@50":"0.6816 ± 0.0041","Validation Hits@50":"1.0000 ± 0.0000"},"paper_url":"https://arxiv.org/abs/2411.03845v1","paper_title":"Reconsidering the Performance of GAE in Link Prediction","paper_date":"2024-11-06","code_links":[{"title":"GraphPKU/Refined-GAE","url":"https://github.com/GraphPKU/Refined-GAE"},{"title":"graphpku/refined-gae","url":"https://github.com/graphpku/refined-gae"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114703,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"TopoLink","metrics":{"Ext. data":"No","Number of params":"483363845","Test Hits@50":"0.6792 ± 0.0074","Validation Hits@50":"0.6771 ± 0.0083"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114704,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"S3GRL (PoS Plus)","metrics":{"Ext. data":"No","Number of params":"5913025","Test Hits@50":"0.6683 ± 0.0030","Validation Hits@50":"0.9861 ± 0.0006"},"paper_url":"https://arxiv.org/abs/2301.12562v4","paper_title":"Simplifying Subgraph Representation Learning for Scalable Link Prediction","paper_date":"2023-01-29","code_links":[{"title":"venomouscyanide/s3grl","url":"https://github.com/venomouscyanide/s3grl"},{"title":"venomouscyanide/s3grl_ogb","url":"https://github.com/venomouscyanide/s3grl_ogb"},{"title":"venomouscyanide/S3GRL_OGB","url":"https://github.com/venomouscyanide/S3GRL_OGB"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114705,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"ELPH","metrics":{"Ext. data":"No","Number of params":"3284065","Test Hits@50":"0.6636 ± 0.5876","Validation Hits@50":"0.6631 ± 0.0021"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114706,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"BUDDY","metrics":{"Ext. data":"No","Number of params":"1184867","Test Hits@50":"0.6572 ± 0.0053","Validation Hits@50":"0.6621 ± 0.0016"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114707,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"Adamic Adar+Edge Proposal Set","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@50":"0.6548 ± 0.0000","Validation Hits@50":"0.9735 ± 0.0000"},"paper_url":"https://arxiv.org/abs/2106.15810v1","paper_title":"Edge Proposal Sets for Link Prediction","paper_date":"2021-06-30","code_links":[{"title":"sangyx/gtrick","url":"https://github.com/sangyx/gtrick/tree/main/benchmark/pyg"},{"title":"CUAI/Edge-Proposal-Sets","url":"https://github.com/CUAI/Edge-Proposal-Sets"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114708,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"SEAL-nofeat (val as input)","metrics":{"Ext. data":"No","Number of params":"501570","Test Hits@50":"0.6474 ± 0.0043","Validation Hits@50":"0.6495 ± 0.0043"},"paper_url":"https://arxiv.org/abs/2010.16103v5","paper_title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","paper_date":"2020-10-30","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/seal"},{"title":"facebookresearch/SEAL_OGB","url":"https://github.com/facebookresearch/SEAL_OGB"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114709,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"Adamic Adar","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@50":"0.6417 ± 0.0000","Validation Hits@50":"0.6349 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114710,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"Common Neighbor","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@50":"0.6137 ± 0.0000","Validation Hits@50":"0.6036 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114711,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"SEAL-nofeat","metrics":{"Ext. data":"No","Number of params":"501570","Test Hits@50":"0.5471 ± 0.0049","Validation Hits@50":"0.6495 ± 0.0043"},"paper_url":"https://arxiv.org/abs/2010.16103v5","paper_title":"Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning","paper_date":"2020-10-30","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/seal"},{"title":"facebookresearch/SEAL_OGB","url":"https://github.com/facebookresearch/SEAL_OGB"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114712,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"GraphSAGE  (val as input)","metrics":{"Ext. data":"No","Number of params":"460289","Test Hits@50":"0.5463 ± 0.0112","Validation Hits@50":"0.5688 ± 0.0077"},"paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","paper_date":"2017-06-07","code_links":[{"title":"pyg-team/pytorch_geometric","url":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/graphsage"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"williamleif/GraphSAGE","url":"https://github.com/williamleif/GraphSAGE"},{"title":"stellargraph/stellargraph","url":"https://github.com/stellargraph/stellargraph"},{"title":"twjiang/graphSAGE-pytorch","url":"https://github.com/twjiang/graphSAGE-pytorch"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"weiyinwei/huign","url":"https://github.com/weiyinwei/huign"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"pmlg/pytorch_GCN","url":"https://github.com/pmlg/pytorch_GCN"},{"title":"chatterjeeayan/upna","url":"https://github.com/chatterjeeayan/upna"},{"title":"Arvidsmile/InductiveDialogueGraph","url":"https://github.com/Arvidsmile/InductiveDialogueGraph"},{"title":"silent-code/deep-trace","url":"https://github.com/silent-code/deep-trace"},{"title":"erfmah/answering_graph_queries","url":"https://github.com/erfmah/answering_graph_queries"},{"title":"hmcreamer/hackRice19","url":"https://github.com/hmcreamer/hackRice19"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114713,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"NGNN + GraphSAGE","metrics":{"Ext. data":"No","Number of params":"591873","Test Hits@50":"0.5359 ± 0.0056","Validation Hits@50":"0.6281 ± 0.0046"},"paper_url":"https://arxiv.org/abs/2111.11638v1","paper_title":"Network In Graph Neural Network","paper_date":"2021-11-23","code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114714,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"NGNN + GCN","metrics":{"Ext. data":"No","Number of params":"428033","Test Hits@50":"0.5348 ± 0.0040","Validation Hits@50":"0.6273 ± 0.0040"},"paper_url":"https://arxiv.org/abs/2111.11638v1","paper_title":"Network In Graph Neural Network","paper_date":"2021-11-23","code_links":[],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114715,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"DeeperGCN","metrics":{"Ext. data":"No","Number of params":"117383","Test Hits@50":"0.5273 ± 0.0047","Validation Hits@50":"0.6187 ± 0.0045"},"paper_url":"https://arxiv.org/abs/2006.07739v1","paper_title":"DeeperGCN: All You Need to Train Deeper GCNs","paper_date":"2020-06-13","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/deepergcn"},{"title":"lightaime/deep_gcns_torch","url":"https://github.com/lightaime/deep_gcns_torch/tree/master/examples/ogb_eff/ogbn_arxiv_dgl"},{"title":"xnuohz/DeeperGCN-dgl","url":"https://github.com/xnuohz/DeeperGCN-dgl"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114716,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"LRGA + GCN","metrics":{"Ext. data":"No","Number of params":"1069489","Test Hits@50":"0.5221 ± 0.0072","Validation Hits@50":"0.6088 ± 0.0059"},"paper_url":"https://arxiv.org/abs/2006.07846v2","paper_title":"Global Attention Improves Graph Networks Generalization","paper_date":"2020-06-14","code_links":[{"title":"omri1348/LRGA","url":"https://github.com/omri1348/LRGA"},{"title":"omri1348/LRGA","url":"https://github.com/omri1348/LRGA/tree/master/ogb/examples/linkproppred"},{"title":"chuanqichen/cs224w","url":"https://github.com/chuanqichen/cs224w"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114717,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"Jaccard Index","metrics":{"Ext. data":"No","Number of params":"0","Test Hits@50":"0.5050 ± 0.0000","Validation Hits@50":"0.6098 ± 0.0000"},"paper_url":"https://arxiv.org/abs/2501.06721v1","paper_title":"On the effect of the average clustering coefficient on topology-based link prediction in featureless graphs","paper_date":"2025-01-12","code_links":[{"title":"rafiepour/ClusteringEffect","url":"https://github.com/rafiepour/ClusteringEffect"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114718,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"DeepWalk","metrics":{"Ext. data":"No","Number of params":"61390187","Test Hits@50":"0.5037 ± 0.0034","Validation Hits@50":"Please tell us"},"paper_url":"http://arxiv.org/abs/1403.6652v2","paper_title":"DeepWalk: Online Learning of Social Representations","paper_date":"2014-03-26","code_links":[{"title":"PaddlePaddle/PaddleRec","url":"https://github.com/PaddlePaddle/PaddleRec/tree/master/models/recall/deepwalk"},{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"williamleif/GraphSAGE","url":"https://github.com/williamleif/GraphSAGE"},{"title":"phanein/deepwalk","url":"https://github.com/phanein/deepwalk"},{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"oj9040/GraphSAGE_RL","url":"https://github.com/oj9040/GraphSAGE_RL"},{"title":"leihuayi/NetworkEmbedding","url":"https://github.com/leihuayi/NetworkEmbedding"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"Robotmurlock/Deepwalk-and-Node2vec","url":"https://github.com/Robotmurlock/Deepwalk-and-Node2vec"},{"title":"printfer/CS6490_NetworkSecurity_FinalProject","url":"https://github.com/printfer/CS6490_NetworkSecurity_FinalProject"},{"title":"gen3111620/DeepWalk","url":"https://github.com/gen3111620/DeepWalk"},{"title":"rforgione/deepwalk","url":"https://github.com/rforgione/deepwalk"},{"title":"ninoxjy/graph-embedding","url":"https://github.com/ninoxjy/graph-embedding"},{"title":"syyunn/node2vec","url":"https://github.com/syyunn/node2vec"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114719,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"Node2vec","metrics":{"Ext. data":"No","Number of params":"30322945","Test Hits@50":"0.4888 ± 0.0054","Validation Hits@50":"0.5703 ± 0.0052"},"paper_url":"http://arxiv.org/abs/1607.00653v1","paper_title":"node2vec: Scalable Feature Learning for Networks","paper_date":"2016-07-03","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/node2vec"},{"title":"shenweichen/GraphEmbedding","url":"https://github.com/shenweichen/GraphEmbedding"},{"title":"aditya-grover/node2vec","url":"https://github.com/aditya-grover/node2vec"},{"title":"benedekrozemberczki/karateclub","url":"https://github.com/benedekrozemberczki/karateclub"},{"title":"eliorc/node2vec","url":"https://github.com/eliorc/node2vec"},{"title":"rusty1s/pytorch_cluster","url":"https://github.com/rusty1s/pytorch_cluster"},{"title":"cvg/scrstudio","url":"https://github.com/cvg/scrstudio"},{"title":"monarch-initiative/embiggen","url":"https://github.com/monarch-initiative/embiggen"},{"title":"TheJacksonLaboratory/N2V","url":"https://github.com/TheJacksonLaboratory/N2V"},{"title":"icd-codex/icd-codex","url":"https://github.com/icd-codex/icd-codex"},{"title":"razrLeLe/fastwalk","url":"https://github.com/razrLeLe/fastwalk"},{"title":"urielsinger/ctdne","url":"https://github.com/urielsinger/ctdne"},{"title":"thibaudmartinez/node2vec","url":"https://github.com/thibaudmartinez/node2vec"},{"title":"olety/TIMLinUCB","url":"https://github.com/olety/TIMLinUCB"},{"title":"fahrbach/icml-2020-faster-graph-embeddings","url":"https://github.com/fahrbach/icml-2020-faster-graph-embeddings"},{"title":"Nina-Konovalova/TSP-RL-Skoltech_project","url":"https://github.com/Nina-Konovalova/TSP-RL-Skoltech_project"},{"title":"urielsinger/fairwalk","url":"https://github.com/urielsinger/fairwalk"},{"title":"Robotmurlock/Deepwalk-and-Node2vec","url":"https://github.com/Robotmurlock/Deepwalk-and-Node2vec"},{"title":"printfer/CS6490_NetworkSecurity_FinalProject","url":"https://github.com/printfer/CS6490_NetworkSecurity_FinalProject"},{"title":"WiktorJ/msnode2vec","url":"https://github.com/WiktorJ/msnode2vec"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114720,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"GraphSAGE","metrics":{"Ext. data":"No","Number of params":"460289","Test Hits@50":"0.4810 ± 0.0081","Validation Hits@50":"0.5688 ± 0.0077"},"paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","paper_date":"2017-06-07","code_links":[{"title":"pyg-team/pytorch_geometric","url":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/graphsage"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"williamleif/GraphSAGE","url":"https://github.com/williamleif/GraphSAGE"},{"title":"stellargraph/stellargraph","url":"https://github.com/stellargraph/stellargraph"},{"title":"twjiang/graphSAGE-pytorch","url":"https://github.com/twjiang/graphSAGE-pytorch"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"weiyinwei/huign","url":"https://github.com/weiyinwei/huign"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"pmlg/pytorch_GCN","url":"https://github.com/pmlg/pytorch_GCN"},{"title":"chatterjeeayan/upna","url":"https://github.com/chatterjeeayan/upna"},{"title":"Arvidsmile/InductiveDialogueGraph","url":"https://github.com/Arvidsmile/InductiveDialogueGraph"},{"title":"silent-code/deep-trace","url":"https://github.com/silent-code/deep-trace"},{"title":"erfmah/answering_graph_queries","url":"https://github.com/erfmah/answering_graph_queries"},{"title":"hmcreamer/hackRice19","url":"https://github.com/hmcreamer/hackRice19"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114721,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"GCN (val as input)","metrics":{"Ext. data":"No","Number of params":"296449","Test Hits@50":"0.4714 ± 0.0145","Validation Hits@50":"0.5263 ± 0.0115"},"paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","paper_date":"2016-09-09","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gcn"},{"title":"tkipf/gcn","url":"https://github.com/tkipf/gcn"},{"title":"tkipf/pygcn","url":"https://github.com/tkipf/pygcn"},{"title":"tkipf/keras-gcn","url":"https://github.com/tkipf/keras-gcn"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"deepchem/moleculenet","url":"https://github.com/deepchem/moleculenet"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"tk-rusch/graphcon","url":"https://github.com/tk-rusch/graphcon"},{"title":"jiangboahu/glcn-tf","url":"https://github.com/jiangboahu/glcn-tf"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"mahsa91/RA-GCN","url":"https://github.com/mahsa91/RA-GCN"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"emartinezs44/SparkGCN","url":"https://github.com/emartinezs44/SparkGCN"},{"title":"yanhuchen/quantum-graph-convolutional-network","url":"https://github.com/yanhuchen/quantum-graph-convolutional-network"},{"title":"HamzaGbada/GCN-Numpy","url":"https://github.com/HamzaGbada/GCN-Numpy"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"cybermonic/cage-4-submission","url":"https://github.com/cybermonic/cage-4-submission"},{"title":"mahsa91/GKD","url":"https://github.com/mahsa91/GKD"},{"title":"selmiss/gp-tlstgcn","url":"https://github.com/selmiss/gp-tlstgcn"},{"title":"hazdzz/GCN","url":"https://github.com/hazdzz/GCN"},{"title":"abi-kothapalli/minimumdominatingsets","url":"https://github.com/abi-kothapalli/minimumdominatingsets"},{"title":"tuananh0305/GCN_ANOMALY_DETECTION","url":"https://github.com/tuananh0305/GCN_ANOMALY_DETECTION"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"negarhdr/PGCN","url":"https://github.com/negarhdr/PGCN"},{"title":"ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS","url":"https://github.com/ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS"},{"title":"bcsrn/gcn","url":"https://github.com/bcsrn/gcn"},{"title":"yCobanoglu/infinite-width-gnns","url":"https://github.com/yCobanoglu/infinite-width-gnns"},{"title":"sunxiaobei/mindspore_gallery","url":"https://github.com/sunxiaobei/mindspore_gallery/tree/main/grl/gcn"},{"title":"kiharalab/gnn_pocket","url":"https://github.com/kiharalab/gnn_pocket"},{"title":"ykrmm/sota_gnn","url":"https://github.com/ykrmm/sota_gnn"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/ascend_gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/gpu_gcn"},{"title":"30Aniket/Graph-Convolutional-Networks-GCNs","url":"https://github.com/30Aniket/Graph-Convolutional-Networks-GCNs"},{"title":"zhiqiang00/Hon-GCN","url":"https://github.com/zhiqiang00/Hon-GCN"},{"title":"clin366/pygcn","url":"https://github.com/clin366/pygcn"},{"title":"nieci2024/pyglcn","url":"https://github.com/nieci2024/pyglcn"},{"title":"mahendrathapa/graph-convolution-network","url":"https://github.com/mahendrathapa/graph-convolution-network"},{"title":"yangjun1994/CAGCN","url":"https://github.com/yangjun1994/CAGCN"},{"title":"darnbi/pygcn","url":"https://github.com/darnbi/pygcn"},{"title":"1075225782/GCN","url":"https://github.com/1075225782/GCN"},{"title":"udlf/wsef","url":"https://github.com/udlf/wsef"},{"title":"thanhtrunghuynh93/pygcn","url":"https://github.com/thanhtrunghuynh93/pygcn"},{"title":"KimMeen/GCN","url":"https://github.com/KimMeen/GCN"},{"title":"LouisDumont/GCN---re-implementation","url":"https://github.com/LouisDumont/GCN---re-implementation"},{"title":"bepping/non-oversmoothing-gcns","url":"https://github.com/bepping/non-oversmoothing-gcns"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"},{"title":"HoganZhang/pygcn_python3","url":"https://github.com/HoganZhang/pygcn_python3"},{"title":"asif-salim/GCN-Graph_Convolutional_Network","url":"https://github.com/asif-salim/GCN-Graph_Convolutional_Network"},{"title":"2023-MindSpore-1/ms-code-11","url":"https://github.com/2023-MindSpore-1/ms-code-11/tree/main/gcn"},{"title":"ajbisberg/gcn","url":"https://github.com/ajbisberg/gcn"},{"title":"lipingcoding/pygcn","url":"https://github.com/lipingcoding/pygcn"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114722,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"VQ-GNN (SAGE-Mean)","metrics":{"Test Hits@50":"0.4673 ± 0.0164 ."},"paper_url":"https://arxiv.org/abs/2110.14363v1","paper_title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","paper_date":"2021-10-27","code_links":[{"title":"devnkong/VQ-GNN","url":"https://github.com/devnkong/VQ-GNN"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114723,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"GCN","metrics":{"Ext. data":"No","Number of params":"296449","Test Hits@50":"0.4475 ± 0.0107","Validation Hits@50":"0.5263 ± 0.0115"},"paper_url":"http://arxiv.org/abs/1609.02907v4","paper_title":"Semi-Supervised Classification with Graph Convolutional Networks","paper_date":"2016-09-09","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gcn"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/tensorflow/gcn"},{"title":"tkipf/gcn","url":"https://github.com/tkipf/gcn"},{"title":"tkipf/pygcn","url":"https://github.com/tkipf/pygcn"},{"title":"tkipf/keras-gcn","url":"https://github.com/tkipf/keras-gcn"},{"title":"meliketoy/graph-cnn.pytorch","url":"https://github.com/meliketoy/graph-cnn.pytorch"},{"title":"deepchem/moleculenet","url":"https://github.com/deepchem/moleculenet"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"tk-rusch/graphcon","url":"https://github.com/tk-rusch/graphcon"},{"title":"jiangboahu/glcn-tf","url":"https://github.com/jiangboahu/glcn-tf"},{"title":"alexOarga/haiku-geometric","url":"https://github.com/alexOarga/haiku-geometric"},{"title":"mahsa91/RA-GCN","url":"https://github.com/mahsa91/RA-GCN"},{"title":"fanzhenliu/dagad","url":"https://github.com/fanzhenliu/dagad"},{"title":"emartinezs44/SparkGCN","url":"https://github.com/emartinezs44/SparkGCN"},{"title":"yanhuchen/quantum-graph-convolutional-network","url":"https://github.com/yanhuchen/quantum-graph-convolutional-network"},{"title":"HamzaGbada/GCN-Numpy","url":"https://github.com/HamzaGbada/GCN-Numpy"},{"title":"nnaakkaaii/g2-MLP","url":"https://github.com/nnaakkaaii/g2-MLP"},{"title":"basiralab/RG-Select","url":"https://github.com/basiralab/RG-Select"},{"title":"basiralab/reproduciblefedgnn","url":"https://github.com/basiralab/reproduciblefedgnn"},{"title":"cybermonic/cage-4-submission","url":"https://github.com/cybermonic/cage-4-submission"},{"title":"mahsa91/GKD","url":"https://github.com/mahsa91/GKD"},{"title":"selmiss/gp-tlstgcn","url":"https://github.com/selmiss/gp-tlstgcn"},{"title":"hazdzz/GCN","url":"https://github.com/hazdzz/GCN"},{"title":"abi-kothapalli/minimumdominatingsets","url":"https://github.com/abi-kothapalli/minimumdominatingsets"},{"title":"tuananh0305/GCN_ANOMALY_DETECTION","url":"https://github.com/tuananh0305/GCN_ANOMALY_DETECTION"},{"title":"basiralab/Reproducible-Generative-Learning","url":"https://github.com/basiralab/Reproducible-Generative-Learning"},{"title":"negarhdr/PGCN","url":"https://github.com/negarhdr/PGCN"},{"title":"ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS","url":"https://github.com/ZeinabRahbar/Implementation-for-the-paper-of-SEMI-SUPERVISED-CLASSIFICATION-WITH-GRAPH-CONVOLUTIONAL-NETWORKS"},{"title":"bcsrn/gcn","url":"https://github.com/bcsrn/gcn"},{"title":"yCobanoglu/infinite-width-gnns","url":"https://github.com/yCobanoglu/infinite-width-gnns"},{"title":"sunxiaobei/mindspore_gallery","url":"https://github.com/sunxiaobei/mindspore_gallery/tree/main/grl/gcn"},{"title":"kiharalab/gnn_pocket","url":"https://github.com/kiharalab/gnn_pocket"},{"title":"ykrmm/sota_gnn","url":"https://github.com/ykrmm/sota_gnn"},{"title":"mahequn001/graphlearning","url":"https://github.com/mahequn001/graphlearning/tree/master/model_zoo/gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/ascend_gcn"},{"title":"alililia/ms_contrib","url":"https://github.com/alililia/ms_contrib/tree/main/gpu_gcn"},{"title":"30Aniket/Graph-Convolutional-Networks-GCNs","url":"https://github.com/30Aniket/Graph-Convolutional-Networks-GCNs"},{"title":"zhiqiang00/Hon-GCN","url":"https://github.com/zhiqiang00/Hon-GCN"},{"title":"clin366/pygcn","url":"https://github.com/clin366/pygcn"},{"title":"nieci2024/pyglcn","url":"https://github.com/nieci2024/pyglcn"},{"title":"mahendrathapa/graph-convolution-network","url":"https://github.com/mahendrathapa/graph-convolution-network"},{"title":"yangjun1994/CAGCN","url":"https://github.com/yangjun1994/CAGCN"},{"title":"darnbi/pygcn","url":"https://github.com/darnbi/pygcn"},{"title":"1075225782/GCN","url":"https://github.com/1075225782/GCN"},{"title":"udlf/wsef","url":"https://github.com/udlf/wsef"},{"title":"thanhtrunghuynh93/pygcn","url":"https://github.com/thanhtrunghuynh93/pygcn"},{"title":"KimMeen/GCN","url":"https://github.com/KimMeen/GCN"},{"title":"LouisDumont/GCN---re-implementation","url":"https://github.com/LouisDumont/GCN---re-implementation"},{"title":"bepping/non-oversmoothing-gcns","url":"https://github.com/bepping/non-oversmoothing-gcns"},{"title":"toinesayan/node-classification-and-label-dependencies","url":"https://github.com/toinesayan/node-classification-and-label-dependencies"},{"title":"HoganZhang/pygcn_python3","url":"https://github.com/HoganZhang/pygcn_python3"},{"title":"asif-salim/GCN-Graph_Convolutional_Network","url":"https://github.com/asif-salim/GCN-Graph_Convolutional_Network"},{"title":"2023-MindSpore-1/ms-code-11","url":"https://github.com/2023-MindSpore-1/ms-code-11/tree/main/gcn"},{"title":"ajbisberg/gcn","url":"https://github.com/ajbisberg/gcn"},{"title":"lipingcoding/pygcn","url":"https://github.com/lipingcoding/pygcn"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114724,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"VQ-GNN (GCN)","metrics":{"Test Hits@50":"0.4316 ± 0.0134"},"paper_url":"https://arxiv.org/abs/2110.14363v1","paper_title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","paper_date":"2021-10-27","code_links":[{"title":"devnkong/VQ-GNN","url":"https://github.com/devnkong/VQ-GNN"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114725,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"VQ-GNN (GAT)","metrics":{"Test Hits@50":"0.4102 ± 0.0099"},"paper_url":"https://arxiv.org/abs/2110.14363v1","paper_title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","paper_date":"2021-10-27","code_links":[{"title":"devnkong/VQ-GNN","url":"https://github.com/devnkong/VQ-GNN"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114726,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"Matrix Factorization","metrics":{"Ext. data":"No","Number of params":"60514049","Test Hits@50":"0.3886 ± 0.0029","Validation Hits@50":"0.4896 ± 0.0029"},"paper_url":"https://arxiv.org/abs/2005.00687v7","paper_title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","paper_date":"2020-05-02","code_links":[{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/products"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/proteins"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/collab"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/ppa"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/mag"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/ddi"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/linkproppred/citation2"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/papers100M"},{"title":"snap-stanford/ogb","url":"https://github.com/snap-stanford/ogb/tree/master/examples/nodeproppred/arxiv"},{"title":"ant-research/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE","url":"https://github.com/ant-research/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE"},{"title":"alipay/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE","url":"https://github.com/alipay/KnowledgeGraphEmbeddingsViaPairedRelationVectors_PairRE"},{"title":"anonymous20221001/sieg_ogb","url":"https://github.com/anonymous20221001/sieg_ogb"},{"title":"destwang/InterHT","url":"https://github.com/destwang/InterHT"},{"title":"xyznlp/trans","url":"https://github.com/xyznlp/trans"},{"title":"ytbai/ogbn_arxiv_dgl","url":"https://github.com/ytbai/ogbn_arxiv_dgl"},{"title":"jingsonglv/CFG","url":"https://github.com/jingsonglv/CFG"},{"title":"jerermyyoung/AutoWeird","url":"https://github.com/jerermyyoung/AutoWeird"},{"title":"chatterjeeayan/upna","url":"https://github.com/chatterjeeayan/upna"},{"title":"icml2024357/hombasis-gnn","url":"https://github.com/icml2024357/hombasis-gnn"},{"title":"ThomPijnenburg/Collab-Link-Prediction","url":"https://github.com/ThomPijnenburg/Collab-Link-Prediction"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114727,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-collab","model_name":"GraphSAGE (val as input)","metrics":{"Number of params":"460289"},"paper_url":"http://arxiv.org/abs/1706.02216v4","paper_title":"Inductive Representation Learning on Large Graphs","paper_date":"2017-06-07","code_links":[{"title":"pyg-team/pytorch_geometric","url":"https://github.com/pyg-team/pytorch_geometric/blob/master/torch_geometric/nn/models/basic_gnn.py"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/graphsage"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/mxnet/gin"},{"title":"williamleif/GraphSAGE","url":"https://github.com/williamleif/GraphSAGE"},{"title":"stellargraph/stellargraph","url":"https://github.com/stellargraph/stellargraph"},{"title":"twjiang/graphSAGE-pytorch","url":"https://github.com/twjiang/graphSAGE-pytorch"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"},{"title":"IllinoisGraphBenchmark/IGB-Datasets","url":"https://github.com/IllinoisGraphBenchmark/IGB-Datasets"},{"title":"arangoml/fastgraphml","url":"https://github.com/arangoml/fastgraphml"},{"title":"zxhhh97/ABot","url":"https://github.com/zxhhh97/ABot"},{"title":"isotlaboratory/ml4vrp","url":"https://github.com/isotlaboratory/ml4vrp"},{"title":"weiyinwei/huign","url":"https://github.com/weiyinwei/huign"},{"title":"qema/orca-py","url":"https://github.com/qema/orca-py"},{"title":"pmlg/pytorch_GCN","url":"https://github.com/pmlg/pytorch_GCN"},{"title":"chatterjeeayan/upna","url":"https://github.com/chatterjeeayan/upna"},{"title":"Arvidsmile/InductiveDialogueGraph","url":"https://github.com/Arvidsmile/InductiveDialogueGraph"},{"title":"silent-code/deep-trace","url":"https://github.com/silent-code/deep-trace"},{"title":"erfmah/answering_graph_queries","url":"https://github.com/erfmah/answering_graph_queries"},{"title":"hmcreamer/hackRice19","url":"https://github.com/hmcreamer/hackRice19"}],"metrics_order":"[\"Test Hits@50\", \"Ext. data\", \"Validation Hits@50\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}