Time-Aware Item Weighting for the Next Basket Recommendations

July 30, 2023 Β· Declared Dead Β· πŸ› ACM Conference on Recommender Systems

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Aleksey Romanov, Oleg Lashinin, Marina Ananyeva, Sergey Kolesnikov arXiv ID 2307.16297 Category cs.IR: Information Retrieval Citations 8 Venue ACM Conference on Recommender Systems Last Checked 4 months ago
Abstract
In this paper we study the next basket recommendation problem. Recent methods use different approaches to achieve better performance. However, many of them do not use information about the time of prediction and time intervals between baskets. To fill this gap, we propose a novel method, Time-Aware Item-based Weighting (TAIW), which takes timestamps and intervals into account. We provide experiments on three real-world datasets, and TAIW outperforms well-tuned state-of-the-art baselines for next-basket recommendations. In addition, we show the results of an ablation study and a case study of a few items.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Retrieval

Died the same way β€” πŸ‘» Ghosted