{"url":"/dataset/amazon-book","name":"Amazon-Book","full_name":null,"description_markdown":"N/A","description_withheld":null,"homepage":"","introduced_date":null,"introduced_date_note":null,"introduced_by":null,"license":null,"modalities":[],"tasks":[{"name":"Recommendation Systems","url":"/task/recommendation-systems","datasets_with_task":"/datasets/task/recommendation-systems"},{"name":"Collaborative Filtering","url":"/task/collaborative-filtering","datasets_with_task":"/datasets/task/collaborative-filtering"}],"languages":[],"variants":["Amazon-Book"],"data_loaders":[],"num_papers_in_archive":18,"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28"},"benchmarks":[{"leaderboard":"/sota/recommendation-systems-on-amazon-book","task":"Recommendation Systems","dataset_variant":"Amazon-Book","rows":16,"metrics":["nDCG@20","Recall@20","HR@10","NDCG@10","HR@50","NDCG@50"],"first_row_in_archive_order":{"model":"SSCF","paper":"/paper/sapling-similarity-outperforms-other-local","metrics":{"Recall@20":"0.0773","nDCG@20":"0.0647"},"code_links":[{"title":"giamba95/saplingsimilarity","url":"https://github.com/giamba95/saplingsimilarity"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/collaborative-filtering-on-amazon-book","task":"Collaborative Filtering","dataset_variant":"Amazon-Book","rows":6,"metrics":["Recall@20","NDCG@20"],"first_row_in_archive_order":{"model":"SANSA","paper":"/paper/scalable-approximate-nonsymmetric-autoencoder","metrics":{"NDCG@20":"0.0637","Recall@20":"0.0768"},"code_links":[{"title":"glami/sansa","url":"https://github.com/glami/sansa"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"},{"leaderboard":"/sota/recommendation-systems-on-amazon-book-1","task":"Recommendation Systems","dataset_variant":"Amazon-book","rows":1,"metrics":["Recall@20"],"first_row_in_archive_order":{"model":"LT-OCF","paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","metrics":{"Recall@20":"0.1875"},"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"}]},"note":"rows are the archive's own order at snapshot; nothing here re-ranks them"}],"papers_with_a_benchmark_row":[{"paper":"/paper/why-is-normalization-necessary-for-linear","title":"Why is Normalization Necessary for Linear Recommenders?","date":"2025-04-08","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/efficient-retrieval-with-learned-similarities","title":"Retrieval with Learned Similarities","date":"2024-07-22","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/turbo-cf-matrix-decomposition-free-graph","title":"Turbo-CF: Matrix Decomposition-Free Graph Filtering for Fast Recommendation","date":"2024-04-22","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":2,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/actions-speak-louder-than-words-trillion","title":"Actions Speak Louder than Words: Trillion-Parameter Sequential Transducers for Generative Recommendations","date":"2024-02-27","rows_on_this_dataset":1,"code_links":12,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":42,"samples_ran":14,"samples_unverified":28,"pointer_only_for_licence":3,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neighborhood-enhanced-supervised-contrastive","title":"Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filtering","date":"2024-02-18","rows_on_this_dataset":1,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":2,"samples_ran":1,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/scalable-approximate-nonsymmetric-autoencoder","title":"Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering","date":"2023-09-14","rows_on_this_dataset":2,"code_links":1,"syntology":null},{"paper":"/paper/perturbation-recovery-method-for","title":"Blurring-Sharpening Process Models for Collaborative Filtering","date":"2022-11-17","rows_on_this_dataset":4,"code_links":1,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":1,"samples_ran":1,"samples_unverified":0,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/sapling-similarity-outperforms-other-local","title":"Sapling Similarity: a performing and interpretable memory-based tool for recommendation","date":"2022-10-13","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/mgdcf-distance-learning-via-markov-graph","title":"MGDCF: Distance Learning via Markov Graph Diffusion for Neural Collaborative Filtering","date":"2022-04-05","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/ultragcn-ultra-simplification-of-graph","title":"UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation","date":"2021-10-28","rows_on_this_dataset":1,"code_links":2,"syntology":null},{"paper":"/paper/simplex-a-simple-and-strong-baseline-for","title":"SimpleX: A Simple and Strong Baseline for Collaborative Filtering","date":"2021-09-26","rows_on_this_dataset":1,"code_links":1,"syntology":null},{"paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","rows_on_this_dataset":3,"code_links":2,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":3,"samples_ran":0,"samples_unverified":3,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","rows_on_this_dataset":2,"code_links":18,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":2,"samples_unverified":5,"pointer_only_for_licence":2,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/neural-graph-collaborative-filtering","title":"Neural Graph Collaborative Filtering","date":"2019-05-20","rows_on_this_dataset":1,"code_links":21,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":7,"samples_ran":6,"samples_unverified":1,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}},{"paper":"/paper/180809781","title":"Self-Attentive Sequential Recommendation","date":"2018-08-20","rows_on_this_dataset":1,"code_links":8,"syntology":{"read_at":"2026-09-24T18:15:14+00:00","samples_harvested":20,"samples_ran":3,"samples_unverified":17,"pointer_only_for_licence":0,"claim":"Per-sample execution on synthesized fixtures; not a correctness claim."}}],"syntology_totals":{"read_at":"2026-09-24T18:15:14+00:00","papers_with_samples":8,"samples_harvested":85,"samples_ran":29,"samples_unverified":56,"pointer_only_for_licence":5,"papers_with_no_sample_that_ran":1,"note":"the per-paper counts above, summed; not a rate"},"papers_note":"The archive never published its papers-using-dataset list; these are papers with a leaderboard row on this dataset's benchmarks."}