{"task":"Recommendation Systems","dataset":"Amazon-Book","metric_names":["nDCG@20","Recall@20","HR@10","NDCG@10","HR@50","NDCG@50"],"rows":[{"id":61342,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"SSCF","metrics":{"Recall@20":"0.0773","nDCG@20":"0.0647"},"paper_url":"https://arxiv.org/abs/2210.07039v2","paper_title":"Sapling Similarity: a performing and interpretable memory-based tool for recommendation","paper_date":"2022-10-13","code_links":[{"title":"giamba95/saplingsimilarity","url":"https://github.com/giamba95/saplingsimilarity"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61343,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"SANSA","metrics":{"Recall@20":"0.0768","nDCG@20":"0.0637"},"paper_url":"https://dl.acm.org/doi/10.1145/3604915.3608827","paper_title":"Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering","paper_date":"2023-09-14","code_links":[{"title":"glami/sansa","url":"https://github.com/glami/sansa"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61344,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"RLAE-DAN","metrics":{"Recall@20":"0.0762","nDCG@20":"0.0630"},"paper_url":"https://arxiv.org/abs/2504.05805v2","paper_title":"Why is Normalization Necessary for Linear Recommenders?","paper_date":"2025-04-08","code_links":[{"title":"psm1206/dan","url":"https://github.com/psm1206/dan"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61345,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"BSPM-LM","metrics":{"Recall@20":"0.0733","nDCG@20":"0.0610"},"paper_url":"https://arxiv.org/abs/2211.09324v2","paper_title":"Blurring-Sharpening Process Models for Collaborative Filtering","paper_date":"2022-11-17","code_links":[{"title":"jeongwhanchoi/bspm","url":"https://github.com/jeongwhanchoi/bspm"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61346,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"BSPM-EM","metrics":{"Recall@20":"0.0733","nDCG@20":"0.0609"},"paper_url":"https://arxiv.org/abs/2211.09324v2","paper_title":"Blurring-Sharpening Process Models for Collaborative Filtering","paper_date":"2022-11-17","code_links":[{"title":"jeongwhanchoi/bspm","url":"https://github.com/jeongwhanchoi/bspm"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61347,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"Turbo-CF","metrics":{"Recall@20":"0.0693","nDCG@20":"0.0574"},"paper_url":"https://arxiv.org/abs/2404.14243v1","paper_title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","paper_date":"2024-04-22","code_links":[{"title":"jindeok/turbo-cf","url":"https://github.com/jindeok/turbo-cf"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61348,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"Emb-GCN","metrics":{"Recall@20":"0.0681","nDCG@20":"0.0556"},"paper_url":"https://arxiv.org/abs/2110.15114v2","paper_title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","paper_date":"2021-10-28","code_links":[{"title":"reczoo/RecZoo","url":"https://github.com/reczoo/RecZoo/tree/main/matching/gnn/UltraGCN"},{"title":"shuyao-wang/dsl","url":"https://github.com/shuyao-wang/dsl"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61349,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"NESCL","metrics":{"Recall@20":"0.0624","nDCG@20":"0.0513"},"paper_url":"https://arxiv.org/abs/2402.11523v1","paper_title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","paper_date":"2024-02-18","code_links":[{"title":"PeiJieSun/NESCL","url":"https://github.com/PeiJieSun/NESCL"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61350,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"SimpleX","metrics":{"Recall@20":"0.0583","nDCG@20":"0.0468"},"paper_url":"https://arxiv.org/abs/2109.12613v3","paper_title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","paper_date":"2021-09-26","code_links":[{"title":"reczoo/RecZoo","url":"https://github.com/reczoo/RecZoo/tree/main/matching/cf/SimpleX"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61351,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"MGDCF","metrics":{"Recall@20":"0.0566","nDCG@20":"0.0460"},"paper_url":"https://arxiv.org/abs/2204.02338v2","paper_title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","paper_date":"2022-04-05","code_links":[{"title":"CrawlScript/Torch-MGDCF","url":"https://github.com/CrawlScript/Torch-MGDCF"},{"title":"hujunxianligong/MGDCF","url":"https://github.com/hujunxianligong/MGDCF"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61352,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"LT-OCF","metrics":{"Recall@20":"0.0442","nDCG@20":"0.0341"},"paper_url":"https://arxiv.org/abs/2108.06208v3","paper_title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","paper_date":"2021-08-08","code_links":[{"title":"jeongwhanchoi/lt-ocf","url":"https://github.com/jeongwhanchoi/lt-ocf"},{"title":"jeongwhanchoi/LT-OCF-Tutorial","url":"https://github.com/jeongwhanchoi/LT-OCF-Tutorial"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61353,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"LightGCN","metrics":{"Recall@20":"0.0411","nDCG@20":"0.0315"},"paper_url":"https://arxiv.org/abs/2002.02126v4","paper_title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","paper_date":"2020-02-06","code_links":[{"title":"microsoft/recommenders","url":"https://github.com/microsoft/recommenders"},{"title":"gusye1234/pytorch-light-gcn","url":"https://github.com/gusye1234/pytorch-light-gcn"},{"title":"PreferredAI/cornac","url":"https://github.com/PreferredAI/cornac"},{"title":"gusye1234/LightGCN-PyTorch","url":"https://github.com/gusye1234/LightGCN-PyTorch"},{"title":"kuandeng/LightGCN","url":"https://github.com/kuandeng/LightGCN"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"LehengTHU/Agent4Rec","url":"https://github.com/LehengTHU/Agent4Rec"},{"title":"yshenaw/GF_CF","url":"https://github.com/yshenaw/GF_CF"},{"title":"jinfeng-xu/fkan-gcf","url":"https://github.com/jinfeng-xu/fkan-gcf"},{"title":"apat1n/LightGCN-Pytorch","url":"https://github.com/apat1n/LightGCN-Pytorch"},{"title":"Wuyxin/LightGCN-parallelized-version","url":"https://github.com/Wuyxin/LightGCN-parallelized-version"},{"title":"shuyao-wang/dsl","url":"https://github.com/shuyao-wang/dsl"},{"title":"lucapantea/LightGCN","url":"https://github.com/lucapantea/LightGCN"},{"title":"sayamsingla2000/LightGCN_MovieLens","url":"https://github.com/sayamsingla2000/LightGCN_MovieLens"},{"title":"JiahaoWuGit/DcRec","url":"https://github.com/JiahaoWuGit/DcRec"},{"title":"Trantin84/NGCF-Tin","url":"https://github.com/Trantin84/NGCF-Tin"},{"title":"tanya525625/LightGCN-PyTorch","url":"https://github.com/tanya525625/LightGCN-PyTorch"},{"title":"nathann3/better_than_netflix_movie_recommender","url":"https://github.com/nathann3/better_than_netflix_movie_recommender"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61354,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"NGCF","metrics":{"Recall@20":"0.0344","nDCG@20":"0.0263"},"paper_url":"https://arxiv.org/abs/1905.08108v2","paper_title":"Neural Graph Collaborative Filtering","paper_date":"2019-05-20","code_links":[{"title":"dmlc/dgl","url":"https://github.com/dmlc/dgl/tree/master/examples/pytorch/NGCF"},{"title":"PreferredAI/cornac","url":"https://github.com/PreferredAI/cornac"},{"title":"xiangwang1223/neural_graph_collaborative_filtering","url":"https://github.com/xiangwang1223/neural_graph_collaborative_filtering"},{"title":"massquantity/LibRecommender","url":"https://github.com/massquantity/LibRecommender"},{"title":"weiyinwei/mmgcn","url":"https://github.com/weiyinwei/mmgcn"},{"title":"huangtinglin/NGCF-PyTorch","url":"https://github.com/huangtinglin/NGCF-PyTorch"},{"title":"talkingwallace/NGCF-pytorch","url":"https://github.com/talkingwallace/NGCF-pytorch"},{"title":"jinfeng-xu/fkan-gcf","url":"https://github.com/jinfeng-xu/fkan-gcf"},{"title":"liu-jc/PyTorch_NGCF","url":"https://github.com/liu-jc/PyTorch_NGCF"},{"title":"GitHubLuCheng/Causal-Understanding-of-Fake-News-Dissemination","url":"https://github.com/GitHubLuCheng/Causal-Understanding-of-Fake-News-Dissemination"},{"title":"weiyinwei/huign","url":"https://github.com/weiyinwei/huign"},{"title":"MiloudBi/NGCF-pytorch","url":"https://github.com/MiloudBi/NGCF-pytorch"},{"title":"lt610/DAGNN","url":"https://github.com/lt610/DAGNN"},{"title":"nathann3/better_than_netflix_movie_recommender","url":"https://github.com/nathann3/better_than_netflix_movie_recommender"},{"title":"florianeBhz/NGCF_Pytorch","url":"https://github.com/florianeBhz/NGCF_Pytorch"},{"title":"xiaoleiHou214/BGCF-pytorch-master","url":"https://github.com/xiaoleiHou214/BGCF-pytorch-master"},{"title":"CHFsky/ngcf-paddle","url":"https://github.com/CHFsky/ngcf-paddle"},{"title":"zzz2010/ngcf-paddle2","url":"https://github.com/zzz2010/ngcf-paddle2"},{"title":"chfhf/ngcf-paddle","url":"https://github.com/chfhf/ngcf-paddle"},{"title":"madansinghal/graphranko","url":"https://github.com/madansinghal/graphranko"},{"title":"immabe/NGCF_pytorch","url":"https://github.com/immabe/NGCF_pytorch"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61355,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"HSTU+MoL","metrics":{"HR@10":"0.0613","HR@50":"0.1292","NDCG@10":"0.0350","NDCG@50":"0.0498"},"paper_url":"https://arxiv.org/abs/2407.15462v4","paper_title":"Retrieval with Learned Similarities","paper_date":"2024-07-22","code_links":[{"title":"bailuding/rails","url":"https://github.com/bailuding/rails"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61356,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"HSTU","metrics":{"HR@10":"0.0478","HR@50":"0.1082","NDCG@10":"0.0262","NDCG@50":"0.0393"},"paper_url":"https://arxiv.org/abs/2402.17152v3","paper_title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","paper_date":"2024-02-27","code_links":[{"title":"facebookresearch/generative-recommenders","url":"https://github.com/facebookresearch/generative-recommenders"},{"title":"alibaba/TorchEasyRec","url":"https://github.com/alibaba/TorchEasyRec"},{"title":"glb400/Toy-RecLM","url":"https://github.com/glb400/Toy-RecLM"},{"title":"bailuding/rails","url":"https://github.com/bailuding/rails"},{"title":"foreverYoungGitHub/generative-recommenders-pl","url":"https://github.com/foreverYoungGitHub/generative-recommenders-pl"},{"title":"roman-dusek/GR-HSTU","url":"https://github.com/roman-dusek/GR-HSTU"},{"title":"snapfinger/hstu-blair","url":"https://github.com/snapfinger/hstu-blair"},{"title":"pwc-1/Paper-9","url":"https://github.com/pwc-1/Paper-9/tree/main/4/GR-HSTU"},{"title":"1hb6s7t/Gr-HSTU","url":"https://github.com/1hb6s7t/Gr-HSTU"},{"title":"MindSpore-scientific-2/code-9","url":"https://github.com/MindSpore-scientific-2/code-9/tree/main/GR-HSTU"},{"title":"MindSpore-scientific/code-4","url":"https://github.com/MindSpore-scientific/code-4/tree/main/GR-HSTU"},{"title":"MindSpore-scientific/code-12","url":"https://github.com/MindSpore-scientific/code-12/tree/main/GR-HSTU"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]},{"id":61357,"task":"Recommendation Systems","parent_task":null,"dataset":"Amazon-Book","model_name":"SASRec","metrics":{"HR@10":"0.0306","HR@50":"0.0754","NDCG@10":"0.0164","NDCG@50":"0.0260"},"paper_url":"http://arxiv.org/abs/1808.09781v1","paper_title":"Self-Attentive Sequential Recommendation","paper_date":"2018-08-20","code_links":[{"title":"microsoft/recommenders","url":"https://github.com/microsoft/recommenders"},{"title":"facebookresearch/generative-recommenders","url":"https://github.com/facebookresearch/generative-recommenders"},{"title":"kang205/SASRec","url":"https://github.com/kang205/SASRec"},{"title":"UlionTse/mlgb","url":"https://github.com/UlionTse/mlgb"},{"title":"pmixer/SASRec.pytorch","url":"https://github.com/pmixer/SASRec.pytorch"},{"title":"otto-de/recsys-dataset","url":"https://github.com/otto-de/recsys-dataset"},{"title":"paddorch/SASRec.paddle","url":"https://github.com/paddorch/SASRec.paddle"},{"title":"mangushev/mfgan","url":"https://github.com/mangushev/mfgan"}],"metrics_order":"[\"nDCG@20\", \"Recall@20\", \"HR@10\", \"NDCG@10\", \"HR@50\", \"NDCG@50\"]","area":"Knowledge Base","uses_additional_data":0,"source":"archive","tags":[]}]}