mlsanityData to 7 Oct 2026

Revisiting Alternative Experimental Settings for Evaluating Top-N Item Recommendation Algorithms

arXiv 2010.04484 ↗First posted 9 Oct 2020cs.IRcited by 24

Not on the map. Why?

Abstract (arXiv)

Top-N item recommendation has been a widely studied task from implicit feedback. Although much progress has been made with neural methods, there is increasing concern on appropriate evaluation of recommendation algorithms. In this paper, we revisit alternative experimental settings for evaluating top-N recommendation algorithms, considering three important factors, namely dataset splitting, sampled metrics and domain selection. We select eight representative recommendation algorithms (covering both traditional and neural methods) and construct extensive experiments on a very large dataset. By carefully revisiting different options, we make several important findings on the three factors, which directly provide useful suggestions on how to appropriately set up the experiments for top-N item recommendation.

Key facts. Cited by 24 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Oct 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 6; 2023: 8; 2024: 6; 2025: 1.

24 papers.

Sort:

By area:

  1. 2022Towards Universal Sequence Representation Learning for Recommender Systemscited by 120
  2. 2023How to Index Item IDs for Recommendation Foundation Modelscited by 102
  3. 2022Filter-enhanced MLP is All You Need for Sequential Recommendationcited by 96
  4. 2022Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learningcited by 86
  5. 2021User-oriented Fairness in Recommendationcited by 75
  6. 2021Personalized Counterfactual Fairness in Recommendationcited by 38
  7. 2022CORE: Simple and Effective Session-based Recommendation within Consistent Representation Spacecited by 37
  8. 2024SLMRec: Distilling Large Language Models into Small for Sequential Recommendationcited by 18
  9. 2021Causal Collaborative Filteringcited by 13
  10. 2023On Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative Filteringcited by 9
  11. 2024Popularity-Aware Alignment and Contrast for Mitigating Popularity Biascited by 9
  12. 2023GUESR: A Global Unsupervised Data-Enhancement with Bucket-Cluster Sampling for Sequential Recommendationcited by 8
12 more
  1. 2023Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approachcited by 4
  2. 2023Counterfactual Collaborative Reasoningcited by 3
  3. 2024Mixed Supervised Graph Contrastive Learning for Recommendationcited by 3
  4. 2024Do We Really Need Graph Convolution During Training? Light Post-Training Graph-ODE for Efficient Recommendationcited by 3
  5. 2022Dynamic Causal Collaborative Filteringcited by 2
  6. 2023Neuro-Symbolic Recommendation Model based on Logic Querycited by 2
  7. 2023Topology-aware Debiased Self-supervised Graph Learning for Recommendationcited by 1
  8. 2024RecSys Arena: Pair-wise Recommender System Evaluation with Large Language Modelscited by 1
  9. 2022Recommender Transformers with Behavior Pathwayscited by 0
  10. 2023On the Sweet Spot of Contrastive Views for Knowledge-enhanced Recommendationcited by 0
  11. 2024Dual Adversarial Perturbators Generate rich Views for Recommendationcited by 0
  12. 2025Lighter-X: An Efficient and Plug-and-play Strategy for Graph-based Recommendation through Decoupled Propagationcited by 0