{"task":"Link Property Prediction","dataset":"ogbl-citation2","metric_names":["Ext. data","Test MRR","Validation MRR","Number of params"],"rows":[{"id":114671,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"GraphGPT(d1n30)","metrics":{"Ext. data":"No","Number of params":"133096832","Test MRR":"0.9305 ± 0.0020","Validation MRR":"0.9295 ± 0.0022"},"paper_url":"https://arxiv.org/abs/2401.00529v1","paper_title":"GraphGPT: Graph Learning with Generative Pre-trained Transformers","paper_date":"2023-12-31","code_links":[{"title":"alibaba/graph-gpt","url":"https://github.com/alibaba/graph-gpt"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114672,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"MPLP","metrics":{"Ext. data":"No","Number of params":"749757283","Test MRR":"0.9072 ± 0.0012","Validation MRR":"0.9074 ± 0.0011"},"paper_url":"https://arxiv.org/abs/2309.00976v4","paper_title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","paper_date":"2023-09-02","code_links":[{"title":"Barcavin/efficient-node-labelling","url":"https://github.com/Barcavin/efficient-node-labelling"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114673,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"GraphGPT(SMTP)","metrics":{"Ext. data":"No","Number of params":"46784128","Test MRR":"0.9055 ± 0.0016","Validation MRR":"0.9042 ± 0.0014"},"paper_url":"https://arxiv.org/abs/2401.00529v1","paper_title":"GraphGPT: Graph Learning with Generative Pre-trained Transformers","paper_date":"2023-12-31","code_links":[{"title":"alibaba/graph-gpt","url":"https://github.com/alibaba/graph-gpt"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114674,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"CFG","metrics":{"Ext. data":"No","Number of params":"686253","Test MRR":"0.8997 ± 0.0015","Validation MRR":"0.8987 ± 0.0011"},"paper_url":"https://arxiv.org/abs/2309.06574v1","paper_title":"Circle Feature Graphormer: Can Circle Features Stimulate Graph Transformer?","paper_date":"2023-09-11","code_links":[{"title":"jingsonglv/CFG","url":"https://github.com/jingsonglv/CFG"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114675,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"SIEG","metrics":{"Ext. data":"No","Number of params":"256802","Test MRR":"0.8957 ± 0.0010","Validation MRR":"0.8948 ± 0.0008"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114676,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"GCN + Heuristic Encoding","metrics":{"Ext. data":"No","Number of params":"372674","Test MRR":"0.8891 ± 0.0005","Validation MRR":"0.8892 ± 0.0005"},"paper_url":"https://arxiv.org/abs/2411.14711v1","paper_title":"Can GNNs Learn Link Heuristics? A Concise Review and Evaluation of Link Prediction Methods","paper_date":"2024-11-22","code_links":[{"title":"astroming/GNNHE","url":"https://github.com/astroming/GNNHE"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114677,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"NGNN + SEAL","metrics":{"Ext. data":"No","Number of params":"1134402","Test MRR":"0.8891 ± 0.0022","Validation MRR":"0.8879 ± 0.0022"},"paper_url":"https://arxiv.org/abs/2111.11638v1","paper_title":"Network In Graph Neural Network","paper_date":"2021-11-23","code_links":[],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114678,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"SUREL","metrics":{"Ext. data":"No","Number of params":"79617","Test MRR":"0.8883 ± 0.0018","Validation MRR":"0.8891 ± 0.0021"},"paper_url":"https://arxiv.org/abs/2202.13538v2","paper_title":"Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning","paper_date":"2022-02-28","code_links":[{"title":"graph-com/surel","url":"https://github.com/graph-com/surel"},{"title":"Graph-COM/SUREL","url":"https://github.com/Graph-COM/SUREL"},{"title":"veritasyin/subg_acc","url":"https://github.com/veritasyin/subg_acc"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114679,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"S3GRL (PoS Plus)","metrics":{"Ext. data":"No","Number of params":"142275001","Test MRR":"0.8814 ± 0.0008","Validation MRR":"0.8809 ± 0.0074"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114680,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"BUDDY","metrics":{"Ext. data":"No","Number of params":"166531","Test MRR":"0.8796 ± 0.0008","Validation MRR":"0.8793 ± 0.0008"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114681,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"SEAL","metrics":{"Ext. data":"No","Number of params":"260802","Test MRR":"0.8767 ± 0.0032","Validation MRR":"0.8757 ± 0.0031"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114682,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"AGDN w/GraphSAINT","metrics":{"Ext. data":"No","Number of params":"306716","Test MRR":"0.8549 ± 0.0029","Validation MRR":"0.8556 ± 0.0033"},"paper_url":"https://arxiv.org/abs/2012.15024v2","paper_title":"Adaptive Graph Diffusion Networks","paper_date":"2020-12-30","code_links":[{"title":"skepsun/SAGN_with_SLE","url":"https://github.com/skepsun/SAGN_with_SLE"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114683,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"PLNLP","metrics":{"Ext. data":"No","Number of params":"146514551","Test MRR":"0.8492 ± 0.0029","Validation MRR":"0.8490 ± 0.0031"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114684,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"Full-batch GCN","metrics":{"Ext. data":"No","Number of params":"296449","Test MRR":"0.8474 ± 0.0021","Validation MRR":"0.8479 ± 0.0023"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114685,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"HPE - Pre-trained Initialized","metrics":{"Ext. data":"No","Number of params":"749558528","Test MRR":"0.8432 ± 0.0003","Validation MRR":"0.8422 ± 0.0002"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114686,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"Full-batch GraphSAGE","metrics":{"Ext. data":"No","Number of params":"460289","Test MRR":"0.8260 ± 0.0036","Validation MRR":"0.8263 ± 0.0033"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114687,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"NeighborSampling (SAGE aggr)","metrics":{"Ext. data":"No","Number of params":"460289","Test MRR":"0.8044 ± 0.0010","Validation MRR":"0.8054 ± 0.0009"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114688,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"ClusterGCN (GCN aggr)","metrics":{"Ext. data":"No","Number of params":"296449","Test MRR":"0.8004 ± 0.0025","Validation MRR":"0.7994 ± 0.0025"},"paper_url":"https://arxiv.org/abs/1905.07953v2","paper_title":"Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networks","paper_date":"2019-05-20","code_links":[{"title":"google-research/google-research","url":"https://github.com/google-research/google-research"},{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/cluster_gcn"},{"title":"benedekrozemberczki/ClusterGCN","url":"https://github.com/benedekrozemberczki/ClusterGCN"},{"title":"qitianwu/nodeformer","url":"https://github.com/qitianwu/nodeformer"},{"title":"NIRVANALAN/ClusterGCN_google-reseach","url":"https://github.com/NIRVANALAN/ClusterGCN_google-reseach"},{"title":"zhengjingwei/cluster_GCN","url":"https://github.com/zhengjingwei/cluster_GCN"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114689,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"GraphSAINT (GCN aggr)","metrics":{"Ext. data":"No","Number of params":"296449","Test MRR":"0.7985 ± 0.0040","Validation MRR":"0.7975 ± 0.0039"},"paper_url":"https://arxiv.org/abs/1907.04931v4","paper_title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","paper_date":"2019-07-10","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/graphsaint"},{"title":"GraphSAINT/GraphSAINT","url":"https://github.com/GraphSAINT/GraphSAINT"},{"title":"thudm/graphmae2","url":"https://github.com/thudm/graphmae2"},{"title":"GraphSAINT/GraphACT","url":"https://github.com/GraphSAINT/GraphACT"},{"title":"lt610/GraphSaint","url":"https://github.com/lt610/GraphSaint"},{"title":"xingsumq/us-defake","url":"https://github.com/xingsumq/us-defake"},{"title":"hyeamykim/GCN-related-works","url":"https://github.com/hyeamykim/GCN-related-works"},{"title":"maysambehmanesh/SGCL","url":"https://github.com/maysambehmanesh/SGCL"}],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114690,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"Node2vec","metrics":{"Ext. data":"No","Number of params":"374911105","Test MRR":"0.6141 ± 0.0011","Validation MRR":"0.6124 ± 0.0011"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114691,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"Adamic Adar","metrics":{"Ext. data":"No","Number of params":"0","Test MRR":"0.5189 ± 0.0000","Validation MRR":"0.5167 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114692,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"Matrix Factorization","metrics":{"Ext. data":"No","Number of params":"281113505","Test MRR":"0.5186 ± 0.0443","Validation MRR":"0.5181 ± 0.0436"},"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":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]},{"id":114693,"task":"Link Property Prediction","parent_task":null,"dataset":"ogbl-citation2","model_name":"Common Neighbor","metrics":{"Ext. data":"No","Number of params":"0","Test MRR":"0.5147 ± 0.0000","Validation MRR":"0.5119 ± 0.0000"},"paper_url":null,"paper_title":null,"paper_date":null,"code_links":[],"metrics_order":"[\"Ext. data\", \"Test MRR\", \"Validation MRR\", \"Number of params\"]","area":"Graphs","uses_additional_data":0,"source":"archive","tags":[]}]}