A Next Basket Recommendation Reality Check

• URL: http://arxiv.org/abs/2109.14233v1
• Date: Wed, 29 Sep 2021 07:14:22 GMT
• Title: A Next Basket Recommendation Reality Check
• Authors: Ming Li, Sami Jullien, Mozhdeh Ariannezhad, Maarten de Rijke
• Abstract summary: The goal of a next basket recommendation (NBR) system is to recommend items for the next basket for a user, based on the sequence of their prior baskets. We provide a novel angle on the evaluation of next basket recommendation methods, centered on the distinction between repetition and exploration. We propose a set of metrics that measure the repeat/explore ratio and performance of NBR models.
• Score: 48.29308926607474
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The goal of a next basket recommendation (NBR) system is to recommend items for the next basket for a user, based on the sequence of their prior baskets. Recently, a number of methods with complex modules have been proposed that claim state-of-the-art performance. They rarely look into the predicted basket and just provide intuitive reasons for the observed improvements, e.g., better representation, capturing intentions or relations, etc. We provide a novel angle on the evaluation of next basket recommendation methods, centered on the distinction between repetition and exploration: the next basket is typically composed of previously consumed items (i.e., repeat items) and new items (i.e, explore items). We propose a set of metrics that measure the repeat/explore ratio and performance of NBR models. Using these new metrics, we analyze state-of-the-art NBR models. The results of our analysis help to clarify the extent of the actual progress achieved by existing NBR methods as well as the underlying reasons for the improvements. Overall, our work sheds light on the evaluation problem of NBR and provides useful insights into the model design for this task.

Related papers

• Within-basket Recommendation via Neural Pattern Associator [6.474720465174676]
  Within-basket recommendation (WBR) refers to the task of recommending items to the end of completing a non-empty shopping basket. This paper presents Neural Pattern Associator (NPA), a deep item-association-mining model that explicitly models user intentions.
  arXiv  Detail & Related papers  (2024-01-25T19:40:55Z)
• Hypergraph Enhanced Knowledge Tree Prompt Learning for Next-Basket Recommendation [50.55786122323965]
  Next-basket recommendation (NBR) aims to infer the items in the next basket given the corresponding basket sequence. HEKP4NBR transforms the knowledge graph (KG) into prompts, namely Knowledge Tree Prompt (KTP), to help PLM encode the Out-Of-Vocabulary (OOV) item IDs. A hypergraph convolutional module is designed to build a hypergraph based on item similarities measured by an MoE model from multiple aspects.
  arXiv  Detail & Related papers  (2023-12-26T02:12:21Z)
• Masked and Swapped Sequence Modeling for Next Novel Basket Recommendation in Grocery Shopping [59.52585406731807]
  Next basket recommendation (NBR) is the task of predicting the next set of items based on a sequence of already purchased baskets. We formulate the next novel basket recommendation (NNBR) task, i.e., the task of recommending a basket that only consists of novel items.
  arXiv  Detail & Related papers  (2023-08-02T17:52:37Z)
• Entailment Tree Explanations via Iterative Retrieval-Generation Reasoner [56.08919422452905]
  We propose an architecture called Iterative Retrieval-Generation Reasoner (IRGR) Our model is able to explain a given hypothesis by systematically generating a step-by-step explanation from textual premises. We outperform existing benchmarks on premise retrieval and entailment tree generation, with around 300% gain in overall correctness.
  arXiv  Detail & Related papers  (2022-05-18T21:52:11Z)
• On Estimating Recommendation Evaluation Metrics under Sampling [21.74579327147525]
  There is still a lack of understanding and consensus on how sampling should be used for recommendation evaluation. In this paper, we introduce a new research problem on learning the empirical rank distribution, and a new approach based on the estimated rank distribution, to estimate the top-k metrics.
  arXiv  Detail & Related papers  (2021-03-02T05:08:21Z)
• CRACT: Cascaded Regression-Align-Classification for Robust Visual Tracking [97.84109669027225]
  We introduce an improved proposal refinement module, Cascaded Regression-Align- Classification (CRAC) CRAC yields new state-of-the-art performances on many benchmarks. In experiments on seven benchmarks including OTB-2015, UAV123, NfS, VOT-2018, TrackingNet, GOT-10k and LaSOT, our CRACT exhibits very promising results in comparison with state-of-the-art competitors.
  arXiv  Detail & Related papers  (2020-11-25T02:18:33Z)
• Modeling Personalized Item Frequency Information for Next-basket Recommendation [63.94555438898309]
  Next-basket recommendation (NBR) is prevalent in e-commerce and retail industry. We argue that existing RNNs cannot directly capture item frequency information in the recommendation scenario. We propose a simple item frequency based k-nearest neighbors (kNN) method to directly utilize these critical signals.
  arXiv  Detail & Related papers  (2020-05-31T16:42:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.