Are We Really Achieving Better Beyond-Accuracy Performance in Next Basket Recommendation?
Ming Li, Yuanna Liu, Sami Jullien, Mozhdeh Ariannezhad, Andrew Yates, Mohammad Aliannejadi, Maarten de Rijke
摘要
Next basket recommendation (NBR) is a special type of sequential recommendation that is increasingly receiving attention. So far, most NBR studies have focused on optimizing the accuracy of the recommendation, whereas optimizing for beyond-accuracy metrics, e.g., item fairness and diversity remains largely unexplored. Recent studies into NBR have found a substantial performance difference between recommending repeat items and explore items. Repeat items contribute most of the users' perceived accuracy compared with explore items.
Informed by these findings, we identify a potential "short-cut" to optimize for beyond-accuracy metrics while maintaining high accuracy. To leverage and verify the existence of such short-cuts, we propose a plug-and-play two-step repetition-exploration (TREx) framework that treats repeat items and explores items separately, where we design a simple yet highly effective repetition module to ensure high accuracy, while two exploration modules target optimizing only beyond-accuracy metrics.
Experiments are performed on two widely-used datasets w.r.t. a range of beyond-accuracy metrics, viz. five fairness metrics and three diversity metrics. Our experimental results show that: (i) we can achieve state-of-the-art performance w.r.t. accuracy via the designed repetition module in TREx; and (ii) the simple TREx framework achieves "better" beyond-accuracy performance than existing sophisticated methods. Prima facie, this appears to be good news: we can achieve high accuracy and improved beyond-accuracy metrics at the same time. However, we argue that the real-world value of our algorithmic solution, TREx, is likely to be limited and reflect on the reasonableness of the evaluation setup. We end up challenging existing evaluation paradigms, particularly in the context of beyond-accuracy metrics, and provide insights for researchers to
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- ST-TGExplainer: Disentangling Stability and Transition Patterns for Temporal GNN InterpretabilityHongjiang Chen, Xin Zheng, Pengfei Jiao, Huan Liu 等ICML 2026
- Time-Interval-Aware Disentangled Expert Modeling for Next-Basket RecommendationZhiying Deng, Yuan Fu, Usman Farooq, Ziwei Tian 等SIGIR 2026
它引用的顶会 Paper13
- Controlling Fairness and Bias in Dynamic Learning-to-RankMarco Morik, Ashudeep Singh, Jessica Hong, Thorsten JoachimsSIGIR 2020 · 被引用 205 次
- DGCN: Diversified Recommendation with Graph Convolutional NetworksYu Zheng, Chen Gao, Liang Chen, Depeng Jin 等WWW 2021 · 被引用 143 次
- The World is Binary: Contrastive Learning for Denoising Next Basket RecommendationYuqi Qin, Pengfei Wang, Chenliang LiSIGIR 2021 · 被引用 138 次
- Modeling Personalized Item Frequency Information for Next-basket RecommendationHaoji Hu, Xiangnan He, Jinyang Gao, Zhi-Li ZhangSIGIR 2020 · 被引用 134 次
- CPFair: Personalized Consumer and Producer Fairness Re-ranking for Recommender SystemsMohammadmehdi Naghiaei, Hossein A. Rahmani, Yashar DeldjooSIGIR 2022 · 被引用 117 次
相关 Paper
- Multi-view Multi-aspect Neural Networks for Next-basket RecommendationZhiying Deng, Jianjun Li, Zhiqiang Guo, Wei Liu 等SIGIR 2023 · 被引用 21 次
- ReCANet: A Repeat Consumption-Aware Neural Network for Next Basket Recommendation in Grocery ShoppingMozhdeh Ariannezhad, Sami Jullien, Ming Li, Min Fang 等SIGIR 2022 · 被引用 62 次
- Next Basket Recommendation with Intent-aware Hypergraph Adversarial NetworkRan Li, Liang Zhang, Guannan Liu, Junjie WuSIGIR 2023 · 被引用 21 次
- Configurable Fairness for New Item Recommendation Considering Entry Time of ItemsHuizhong Guo, Dongxia Wang, Zhu Sun, Haonan Zhang 等SIGIR 2024 · 被引用 4 次
- LISRec: Modeling User Preferences with Learned Item Shortcuts for Sequential RecommendationHaidong Xin, Zhenghao Liu, Sen Mei, Yukun Yan 等KDD 2026 · 被引用 1 次
