A Revisiting Study of Appropriate Offline Evaluation for Top- N Recommendation Algorithms

Author:

Zhao Wayne Xin1ORCID,Lin Zihan1ORCID,Feng Zhichao2ORCID,Wang Pengfei2ORCID,Wen Ji-Rong1ORCID

Affiliation:

1. Renmin University of China, Beijing, China

2. Beijing University of Posts and Telecommunications, Beijing, China

Abstract

In recommender systems, top- N recommendation is an important task with implicit feedback data. Although the recent success of deep learning largely pushes forward the research on top- N recommendation, there are increasing concerns on appropriate evaluation of recommendation algorithms. It therefore is important to study how recommendation algorithms can be reliably evaluated and thoroughly verified. This work presents a large-scale, systematic study on six important factors from three aspects for evaluating recommender systems. We carefully select 12 top- N recommendation algorithms and eight recommendation datasets. Our experiments are carefully designed and extensively conducted with these algorithms and datasets. In particular, all the experiments in our work are implemented based on an open sourced recommendation library, Recbole [ 139 ], which ensures the reproducibility and reliability of our results. Based on the large-scale experiments and detailed analysis, we derive several key findings on the experimental settings for evaluating recommender systems. Our findings show that some settings can lead to substantial or significant differences in performance ranking of the compared algorithms. In response to recent evaluation concerns, we also provide several suggested settings that are specially important for performance comparison.

Funder

National Natural Science Foundation of China

Beijing Natural Science Foundation

Beijing Outstanding Young Scientist Program

Beijing Academy of Artificial Intelligence

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,General Business, Management and Accounting,Information Systems

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On the Consistency, Discriminative Power and Robustness of Sampled Metrics in Offline Top-N Recommender System Evaluation;Proceedings of the 17th ACM Conference on Recommender Systems;2023-09-14

2. Integrating Item Relevance in Training Loss for Sequential Recommender Systems;Proceedings of the 17th ACM Conference on Recommender Systems;2023-09-14

3. What We Evaluate When We Evaluate Recommender Systems: Understanding Recommender Systems’ Performance using Item Response Theory;Proceedings of the 17th ACM Conference on Recommender Systems;2023-09-14

4. Towards a More User-Friendly and Easy-to-Use Benchmark Library for Recommender Systems;Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval;2023-07-18

5. Towards Efficient and Effective Transformers for Sequential Recommendation;Database Systems for Advanced Applications;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3